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_array_oct.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:48:05,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:48:05,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:48:05,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:48:05,909 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:48:05,910 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:48:05,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:48:05,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:48:05,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:48:05,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:48:05,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:48:05,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:48:05,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:48:05,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:48:05,925 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:48:05,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:48:05,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:48:05,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:48:05,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:48:05,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:48:05,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:48:05,947 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:48:05,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:48:05,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:48:05,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:48:05,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:48:05,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:48:05,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:48:05,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:48:05,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:48:05,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:48:05,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:48:05,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:48:05,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:48:05,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:48:05,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:48:05,962 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:48:05,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:48:05,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:48:05,994 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:48:05,995 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:48:05,995 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:48:05,995 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:48:05,995 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:48:05,995 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:48:05,996 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:48:05,996 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:48:05,996 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:48:05,996 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:48:05,996 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:48:05,997 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:48:05,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:48:05,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:48:06,001 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:48:06,001 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:48:06,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:48:06,002 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:48:06,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:48:06,002 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:48:06,002 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:48:06,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:48:06,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:48:06,005 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:48:06,005 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:48:06,006 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:48:06,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:48:06,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:48:06,006 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:48:06,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:48:06,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:48:06,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:48:06,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:48:06,007 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:48:06,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:48:06,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:48:06,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:48:06,009 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:48:06,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:48:06,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:48:06,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:48:06,070 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:48:06,070 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:48:06,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 18:48:06,072 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 18:48:06,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:48:06,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:48:06,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:48:06,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:48:06,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:48:06,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:48:06,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:48:06,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:48:06,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:48:06,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/1) ... [2018-12-03 18:48:06,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:48:06,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:48:06,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:48:06,180 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:48:06,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (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-03 18:48:06,254 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 18:48:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:48:06,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:48:06,526 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:48:06,527 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:48:06,527 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:48:06 BoogieIcfgContainer [2018-12-03 18:48:06,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:48:06,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:48:06,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:48:06,532 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:48:06,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:06" (1/2) ... [2018-12-03 18:48:06,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f3c80 and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:48:06, skipping insertion in model container [2018-12-03 18:48:06,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:48:06" (2/2) ... [2018-12-03 18:48:06,535 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 18:48:06,546 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:48:06,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:48:06,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:48:06,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:48:06,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:48:06,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:48:06,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:48:06,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:48:06,612 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:48:06,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:48:06,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:48:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 18:48:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:48:06,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:06,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:48:06,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:06,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:48:06,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:06,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:06,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:06,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:06,826 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-03 18:48:06,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:06,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:48:06,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:06,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:48:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:48:06,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:48:06,853 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 18:48:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:06,944 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 18:48:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:48:06,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:48:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:06,974 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:48:06,974 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:48:06,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:48:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:48:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 18:48:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:48:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 18:48:07,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 18:48:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:07,042 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 18:48:07,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:48:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 18:48:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:48:07,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:07,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:48:07,044 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:07,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-12-03 18:48:07,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:07,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:07,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:48:07,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:07,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:48:07,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:07,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:48:07,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:48:07,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:48:07,208 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-03 18:48:07,360 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-12-03 18:48:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:07,422 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 18:48:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:48:07,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 18:48:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:07,423 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:48:07,423 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:48:07,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:48:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:48:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:48:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:48:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 18:48:07,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 18:48:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:07,429 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 18:48:07,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:48:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 18:48:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:48:07,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:07,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 18:48:07,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:07,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-12-03 18:48:07,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:07,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:07,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:48:07,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:07,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:07,628 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 18:48:07,631 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 18:48:07,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:48:07,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:48:08,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:48:08,771 INFO L272 AbstractInterpreter]: Visited 6 different actions 222 times. Merged at 5 different actions 120 times. Widened at 4 different actions 96 times. Found 81 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 18:48:08,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:08,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:48:08,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,813 INFO L192 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-03 18:48:08,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:08,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:08,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:48:09,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:48:09,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:09,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2018-12-03 18:48:09,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:09,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:48:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:48:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:48:09,439 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-12-03 18:48:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:09,502 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 18:48:09,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:48:09,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 18:48:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:09,504 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:48:09,504 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:48:09,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:48:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:48:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:48:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:48:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 18:48:09,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 18:48:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:09,509 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 18:48:09,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:48:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 18:48:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:48:09,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:09,510 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 18:48:09,511 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:09,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-12-03 18:48:09,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:09,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:09,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 18:48:09,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:09,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:09,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:09,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,675 INFO L192 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-03 18:48:09,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:09,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:09,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:48:09,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:09,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 18:48:09,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 18:48:09,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:09,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 18:48:09,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:09,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:48:09,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:48:09,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:48:09,998 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-12-03 18:48:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:10,170 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 18:48:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:48:10,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 18:48:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:10,172 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:48:10,172 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:48:10,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:48:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:48:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 18:48:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:48:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 18:48:10,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 18:48:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:10,178 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 18:48:10,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:48:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 18:48:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:48:10,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:10,179 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 18:48:10,180 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:10,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:10,180 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-12-03 18:48:10,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:10,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:48:10,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:10,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:10,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:10,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:10,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:10,312 INFO L192 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-03 18:48:10,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:10,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:10,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:10,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:10,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:48:10,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:48:10,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:10,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2018-12-03 18:48:10,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:10,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:48:10,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:48:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:48:10,590 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 9 states. [2018-12-03 18:48:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:10,614 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 18:48:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:48:10,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 18:48:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:10,617 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:48:10,618 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:48:10,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:48:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:48:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:48:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:48:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 18:48:10,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 18:48:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:10,623 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 18:48:10,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:48:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 18:48:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:48:10,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:10,625 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 18:48:10,625 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:10,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-12-03 18:48:10,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 18:48:10,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:10,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:10,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:10,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:10,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:10,851 INFO L192 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-03 18:48:10,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:10,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:10,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 18:48:10,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 18:48:11,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:11,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2018-12-03 18:48:11,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:11,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:48:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:48:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:48:11,442 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-12-03 18:48:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:11,486 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 18:48:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:48:11,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-12-03 18:48:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:11,487 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:48:11,487 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:48:11,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:48:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:48:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:48:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:48:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 18:48:11,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 18:48:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:11,499 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 18:48:11,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:48:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 18:48:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:48:11,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:11,500 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 18:48:11,500 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:11,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-12-03 18:48:11,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:11,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:11,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 18:48:11,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:11,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:11,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:11,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:11,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:11,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:11,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:48:11,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:11,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 18:48:11,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 18:48:11,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:11,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2018-12-03 18:48:11,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:11,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:48:11,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:48:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:48:11,937 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-12-03 18:48:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:11,989 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-03 18:48:11,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:48:11,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-12-03 18:48:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:11,990 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:48:11,990 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:48:11,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:48:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:48:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:48:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:48:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 18:48:11,998 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 18:48:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:11,998 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 18:48:11,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:48:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 18:48:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:48:11,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:12,000 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-12-03 18:48:12,000 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:12,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 6 times [2018-12-03 18:48:12,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:48:12,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:12,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:12,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:12,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:12,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:12,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:12,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:12,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:12,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:48:12,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:48:12,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:12,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 18:48:12,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:12,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:48:12,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:48:12,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:48:12,507 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-12-03 18:48:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:12,590 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-03 18:48:12,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:48:12,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-12-03 18:48:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:12,591 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:48:12,591 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:48:12,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:48:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:48:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:48:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:48:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 18:48:12,597 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 18:48:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:12,597 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 18:48:12,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:48:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 18:48:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:48:12,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:12,598 INFO L402 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-12-03 18:48:12,598 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:12,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 7 times [2018-12-03 18:48:12,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 18:48:12,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:12,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:12,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:12,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:12,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:12,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 18:48:12,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 18:48:13,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:13,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-12-03 18:48:13,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:13,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:48:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:48:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:48:13,035 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2018-12-03 18:48:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:13,076 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-03 18:48:13,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:48:13,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-12-03 18:48:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:13,078 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:48:13,078 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:48:13,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:48:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:48:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:48:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:48:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 18:48:13,084 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 18:48:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:13,084 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 18:48:13,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:48:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 18:48:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:48:13,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:13,085 INFO L402 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2018-12-03 18:48:13,085 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:13,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1207878301, now seen corresponding path program 8 times [2018-12-03 18:48:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:13,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:13,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 18:48:13,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:13,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:13,269 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:13,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:13,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:13,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:13,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:13,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:13,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:48:13,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:13,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 18:48:13,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 18:48:13,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:13,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-12-03 18:48:13,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:13,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:48:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:48:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:48:13,512 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2018-12-03 18:48:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:13,556 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-03 18:48:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:48:13,563 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 18:48:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:13,564 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:48:13,564 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:48:13,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:48:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:48:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:48:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:48:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 18:48:13,572 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 18:48:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:13,573 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 18:48:13,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:48:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 18:48:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:48:13,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:13,573 INFO L402 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2018-12-03 18:48:13,577 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:13,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash 207974103, now seen corresponding path program 9 times [2018-12-03 18:48:13,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:13,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:13,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:13,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:13,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 18:48:13,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:13,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:13,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:13,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:13,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:13,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:13,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:13,733 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:13,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:13,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:13,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 18:48:14,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 18:48:14,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:14,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 18:48:14,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:14,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:48:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:48:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:48:14,872 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2018-12-03 18:48:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:15,090 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-03 18:48:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:48:15,091 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-12-03 18:48:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:15,091 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:48:15,092 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:48:15,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:48:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:48:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:48:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:48:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 18:48:15,097 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 18:48:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:15,097 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 18:48:15,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:48:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 18:48:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:48:15,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:15,098 INFO L402 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2018-12-03 18:48:15,099 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:15,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 864577571, now seen corresponding path program 10 times [2018-12-03 18:48:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 18:48:15,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:15,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:15,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:15,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:15,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:15,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:15,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:15,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:15,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 18:48:15,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 18:48:15,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:15,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-12-03 18:48:15,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:15,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:48:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:48:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:48:15,688 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 23 states. [2018-12-03 18:48:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:15,776 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-03 18:48:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:48:15,779 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-03 18:48:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:15,780 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:48:15,780 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:48:15,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:48:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:48:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:48:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:48:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 18:48:15,787 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 18:48:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:15,788 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 18:48:15,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:48:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 18:48:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:48:15,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:15,789 INFO L402 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2018-12-03 18:48:15,789 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:15,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash 595035287, now seen corresponding path program 11 times [2018-12-03 18:48:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:15,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 18:48:15,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:15,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:15,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:15,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:15,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:15,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:15,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:15,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:16,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 18:48:16,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:16,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 18:48:16,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 18:48:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:16,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 18:48:16,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:16,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:48:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:48:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:48:16,279 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-12-03 18:48:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:16,344 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 18:48:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:48:16,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-03 18:48:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:16,346 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:48:16,346 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:48:16,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:48:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:48:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-12-03 18:48:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:48:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-03 18:48:16,355 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2018-12-03 18:48:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:16,355 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-03 18:48:16,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:48:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-03 18:48:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:48:16,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:16,356 INFO L402 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-12-03 18:48:16,357 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:16,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 12 times [2018-12-03 18:48:16,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 18:48:16,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:16,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:16,677 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:16,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:16,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:16,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:16,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:16,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:16,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:16,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:16,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 18:48:16,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 18:48:16,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2018-12-03 18:48:16,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:16,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:48:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:48:16,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:48:16,858 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-12-03 18:48:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:16,928 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-12-03 18:48:16,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:48:16,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-03 18:48:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:16,930 INFO L225 Difference]: With dead ends: 65 [2018-12-03 18:48:16,930 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:48:16,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:48:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:48:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-12-03 18:48:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:48:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-03 18:48:16,943 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-12-03 18:48:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:16,944 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-03 18:48:16,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:48:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-03 18:48:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:48:16,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:16,945 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-12-03 18:48:16,946 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:16,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 13 times [2018-12-03 18:48:16,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 18:48:17,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:17,106 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:17,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:17,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:17,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 18:48:17,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 18:48:17,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:17,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2018-12-03 18:48:17,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:48:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:48:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:48:17,363 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-12-03 18:48:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:17,435 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-12-03 18:48:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:48:17,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-03 18:48:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:17,437 INFO L225 Difference]: With dead ends: 77 [2018-12-03 18:48:17,437 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 18:48:17,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:48:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 18:48:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-12-03 18:48:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:48:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-12-03 18:48:17,454 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-12-03 18:48:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:17,454 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-12-03 18:48:17,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:48:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-12-03 18:48:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:48:17,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:17,456 INFO L402 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-12-03 18:48:17,456 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:17,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:17,457 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 14 times [2018-12-03 18:48:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 18:48:18,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:18,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:18,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:18,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:18,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:18,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:18,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:18,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:18,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 18:48:18,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:18,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 18:48:18,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 18:48:18,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:18,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2018-12-03 18:48:18,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:18,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:48:18,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:48:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:48:18,519 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-12-03 18:48:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:18,580 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-12-03 18:48:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:48:18,581 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-12-03 18:48:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:18,582 INFO L225 Difference]: With dead ends: 89 [2018-12-03 18:48:18,582 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 18:48:18,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:48:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 18:48:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-12-03 18:48:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 18:48:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-12-03 18:48:18,602 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-12-03 18:48:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:18,603 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-12-03 18:48:18,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:48:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-12-03 18:48:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:48:18,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:18,604 INFO L402 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-12-03 18:48:18,605 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:18,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 15 times [2018-12-03 18:48:18,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:18,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:18,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 18:48:18,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:18,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:18,862 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:18,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:18,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:18,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:18,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:18,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:18,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:18,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:18,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 18:48:19,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 18:48:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-12-03 18:48:19,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:19,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:48:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:48:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:48:19,211 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-12-03 18:48:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:19,302 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-03 18:48:19,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:48:19,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-12-03 18:48:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:19,304 INFO L225 Difference]: With dead ends: 101 [2018-12-03 18:48:19,304 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 18:48:19,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:48:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 18:48:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 18:48:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:48:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 18:48:19,326 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-12-03 18:48:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:19,327 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 18:48:19,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:48:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 18:48:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:48:19,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:19,328 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 18:48:19,328 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:19,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 16 times [2018-12-03 18:48:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:19,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:19,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 18:48:19,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:19,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:19,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:19,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:19,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:19,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:19,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:19,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:19,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 18:48:19,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 18:48:20,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 18:48:20,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:20,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:48:20,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:48:20,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:48:20,034 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-12-03 18:48:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:20,178 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 18:48:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:48:20,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-12-03 18:48:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:20,181 INFO L225 Difference]: With dead ends: 113 [2018-12-03 18:48:20,181 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 18:48:20,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:48:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 18:48:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 18:48:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:48:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 18:48:20,213 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 18:48:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:20,213 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 18:48:20,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:48:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 18:48:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:48:20,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:20,221 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 18:48:20,221 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:20,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 17 times [2018-12-03 18:48:20,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:20,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:20,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:20,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 18:48:20,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:20,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:20,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:20,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:20,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:20,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:20,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:20,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 18:48:20,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:20,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 18:48:20,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 18:48:20,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:20,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 18:48:20,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:20,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:48:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:48:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:48:20,954 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-12-03 18:48:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:21,220 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 18:48:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:48:21,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-12-03 18:48:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:21,222 INFO L225 Difference]: With dead ends: 125 [2018-12-03 18:48:21,222 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 18:48:21,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 179 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:48:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 18:48:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 18:48:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 18:48:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 18:48:21,250 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 18:48:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:21,250 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 18:48:21,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:48:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 18:48:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 18:48:21,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:21,252 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 18:48:21,252 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:21,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 18 times [2018-12-03 18:48:21,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:21,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:21,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 18:48:22,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:22,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:22,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:22,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:22,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:22,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:22,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:22,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:22,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:22,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:22,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 18:48:22,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 18:48:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:22,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:48:22,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:22,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:48:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:48:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:48:22,533 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-12-03 18:48:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:22,612 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 18:48:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:48:22,612 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-12-03 18:48:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:22,613 INFO L225 Difference]: With dead ends: 137 [2018-12-03 18:48:22,613 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 18:48:22,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 201 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:48:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 18:48:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 18:48:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 18:48:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 18:48:22,637 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 18:48:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:22,638 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 18:48:22,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:48:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 18:48:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 18:48:22,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:22,639 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 18:48:22,639 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:22,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:22,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 19 times [2018-12-03 18:48:22,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:22,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:22,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-12-03 18:48:28,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:28,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 18:48:28,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 18:48:28,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:48:28,960 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-12-03 18:48:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:31,353 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-12-03 18:48:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 18:48:31,354 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-12-03 18:48:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:31,354 INFO L225 Difference]: With dead ends: 5119 [2018-12-03 18:48:31,354 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:48:31,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:48:31,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:48:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:48:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:48:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:48:31,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-12-03 18:48:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:31,366 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:48:31,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 18:48:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:48:31,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:48:31,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:48:37,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:37,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:38,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:38,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:38,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:38,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:38,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:38,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:39,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:39,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:39,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:39,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:39,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:40,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:41,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:42,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:42,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:42,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:42,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:42,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:42,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:42,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:43,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:44,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:44,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:44,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:44,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:44,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:45,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:45,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:45,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:45,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:45,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:46,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:46,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:46,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:46,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:46,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:46,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:47,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:47,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:47,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:48,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:48,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:48,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:48,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:49,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:50,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:51,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:53,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:53,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:53,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:53,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:54,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:54,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:54,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:54,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:55,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:56,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:57,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:57,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:58,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:58,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:48:59,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:00,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:00,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:00,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:01,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:02,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:02,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:02,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:02,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:02,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:02,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:03,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:04,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:04,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:04,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:04,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:04,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:04,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:06,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:06,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:06,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:07,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:07,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:10,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:10,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:11,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:11,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:12,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:13,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:13,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:14,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:14,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:14,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:15,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:16,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:16,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:16,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:17,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:17,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:17,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:17,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:17,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:18,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:18,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:20,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:21,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:21,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:23,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:23,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:24,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:24,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:26,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:26,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:26,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:33,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:33,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:35,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:37,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:37,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:38,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:38,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:39,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:39,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:44,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:44,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:44,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:44,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:46,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:49,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:51,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:52,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:53,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:53,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:55,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:56,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:58,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:50:06,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:50:15,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:50:29,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:50:34,380 WARN L180 SmtUtils]: Spent 2.05 m on a formula simplification. DAG size of input: 5095 DAG size of output: 2491 [2018-12-03 18:50:35,398 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-12-03 18:52:40,500 WARN L180 SmtUtils]: Spent 2.08 m on a formula simplification. DAG size of input: 2491 DAG size of output: 362 [2018-12-03 18:52:46,935 WARN L180 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-12-03 18:52:46,940 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-12-03 18:52:46,942 INFO L444 ceAbstractionStarter]: At program point L64(lines 49 65) the Hoare annotation is: (let ((.cse38 (<= ULTIMATE.start_main_~j~5 2)) (.cse31 (<= ULTIMATE.start_main_~j~5 6)) (.cse13 (<= ULTIMATE.start_main_~j~5 5)) (.cse17 (<= ULTIMATE.start_main_~j~5 7)) (.cse6 (<= ULTIMATE.start_main_~j~5 9)) (.cse39 (<= ULTIMATE.start_main_~j~5 0)) (.cse7 (<= ULTIMATE.start_main_~j~5 3)) (.cse37 (<= ULTIMATE.start_main_~j~5 1)) (.cse29 (<= ULTIMATE.start_main_~j~5 4)) (.cse36 (<= ULTIMATE.start_main_~j~5 8)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5))) (let ((.cse22 (<= 40 ULTIMATE.start_main_~k~5)) (.cse26 (<= 60 ULTIMATE.start_main_~k~5)) (.cse27 (<= 90 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse23 (<= 70 ULTIMATE.start_main_~k~5)) (.cse12 (and .cse36 .cse4)) (.cse32 (<= 50 ULTIMATE.start_main_~k~5)) (.cse28 (and .cse29 .cse4)) (.cse21 (and .cse37 .cse4)) (.cse25 (<= 80 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 7)) (.cse2 (<= ULTIMATE.start_main_~i~5 4)) (.cse10 (and .cse7 .cse4)) (.cse24 (and .cse4 .cse39)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse16 (and .cse4 .cse6)) (.cse11 (<= ULTIMATE.start_main_~i~5 8)) (.cse14 (and .cse17 .cse4)) (.cse9 (<= ULTIMATE.start_main_~i~5 3)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse8 (<= ULTIMATE.start_main_~i~5 0)) (.cse30 (<= ULTIMATE.start_main_~i~5 2)) (.cse1 (and .cse13 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 6)) (.cse20 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse33 (and .cse31 .cse4)) (.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse19 (<= ULTIMATE.start_main_~i~5 5)) (.cse34 (and .cse4 .cse38))) (or (and .cse0 (<= 45 ULTIMATE.start_main_~k~5) .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse6) (and .cse0 (<= 3 ULTIMATE.start_main_~k~5) .cse7 .cse4 .cse8) (and .cse0 .cse9 .cse10 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 (<= 88 ULTIMATE.start_main_~k~5) .cse12) (and .cse0 .cse13 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse15 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse10 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse0 .cse16 .cse9 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 7 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse8) (and .cse0 .cse1 .cse18 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 57 ULTIMATE.start_main_~k~5) .cse14) (and (and .cse20 .cse21) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse0 .cse22 .cse9 .cse4) (and .cse0 .cse4 .cse6 (<= 9 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse23 .cse15 .cse4) (and .cse0 .cse11 .cse24 .cse25) (and .cse0 (<= 61 ULTIMATE.start_main_~k~5) .cse21 .cse15) (and .cse0 .cse17 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and (and .cse20 .cse4) (<= 100 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 .cse24 .cse15) (and .cse0 .cse22 .cse24 .cse2) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse20 .cse12)) (and .cse0 .cse11 .cse27 .cse4) (and .cse0 (<= 78 ULTIMATE.start_main_~k~5) .cse12 .cse18) (and .cse0 .cse10 (<= 73 ULTIMATE.start_main_~k~5) .cse18) (and .cse0 (<= 34 ULTIMATE.start_main_~k~5) .cse9 .cse28) (and .cse0 .cse19 .cse26 .cse4) (and .cse0 (<= 38 ULTIMATE.start_main_~k~5) .cse9 .cse12) (and .cse0 (<= 77 ULTIMATE.start_main_~k~5) .cse14 .cse18) (and .cse0 .cse29 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 (<= 29 ULTIMATE.start_main_~k~5) .cse30 .cse4 .cse6) (and .cse0 .cse31 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse8) (and (and .cse20 .cse10) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 71 ULTIMATE.start_main_~k~5) .cse21 .cse18) (and .cse27 (and .cse20 .cse24)) (and .cse0 .cse16 (<= 69 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse32 .cse4 .cse2) (and .cse0 .cse9 .cse1 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 (<= 54 ULTIMATE.start_main_~k~5) .cse19) (and .cse0 (<= 56 ULTIMATE.start_main_~k~5) .cse19 .cse33) (and (<= 92 ULTIMATE.start_main_~k~5) (and .cse20 .cse34)) (and .cse0 (<= 76 ULTIMATE.start_main_~k~5) .cse33 .cse18) (and .cse0 .cse2 .cse16 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse0 .cse14 (<= 47 ULTIMATE.start_main_~k~5) .cse2) (and (<= 99 ULTIMATE.start_main_~k~5) (and .cse20 .cse16)) (and .cse0 .cse30 .cse4 .cse35) (and .cse0 .cse31 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse12 .cse15 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 18 ULTIMATE.start_main_~k~5) .cse36 .cse4 .cse5) (and .cse0 .cse34 .cse15 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 1 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse8) (and .cse0 (<= 41 ULTIMATE.start_main_~k~5) .cse21 .cse2) (and .cse0 (<= 72 ULTIMATE.start_main_~k~5) .cse34 .cse18) (and .cse0 (<= 11 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse5) (and .cse0 .cse29 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse38) (and .cse0 .cse3 .cse30 .cse4 .cse39) (and .cse0 .cse10 .cse15 (<= 63 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse0 .cse28 .cse18) (and .cse0 (<= 64 ULTIMATE.start_main_~k~5) .cse28 .cse15) (and .cse0 .cse11 (<= 82 ULTIMATE.start_main_~k~5) .cse34) (and .cse0 .cse19 (<= 51 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse36 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse9 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse0 .cse33 (<= 66 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse23 .cse24 .cse18) (and .cse0 .cse33 .cse9 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse34 (<= 42 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse19 .cse12 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 55 ULTIMATE.start_main_~k~5) .cse1) (and (and .cse20 .cse1) (<= 95 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 .cse2 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 48 ULTIMATE.start_main_~k~5) .cse2 .cse12) (and .cse0 .cse11 (<= 84 ULTIMATE.start_main_~k~5) .cse28) (and .cse0 .cse11 .cse33 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse31 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse30 (<= 27 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse30 (<= 28 ULTIMATE.start_main_~k~5) .cse36 .cse4) (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse39 .cse8) (and .cse0 .cse32 .cse19 .cse24) (and .cse0 .cse11 (<= 89 ULTIMATE.start_main_~k~5) .cse16) (and (and .cse20 .cse14) (<= 97 ULTIMATE.start_main_~k~5)) (and .cse0 .cse29 .cse30 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse16 (<= 79 ULTIMATE.start_main_~k~5) .cse18) (and (and .cse20 .cse28) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse38 .cse8) (and .cse0 .cse10 (<= 43 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse11 .cse1 (<= 85 ULTIMATE.start_main_~k~5)) (and .cse0 .cse9 .cse21 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse7 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse11 (<= 81 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse30 (<= 25 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse0 .cse4 .cse25 .cse18) (and .cse0 (<= 46 ULTIMATE.start_main_~k~5) .cse33 .cse2) (and .cse0 (<= 53 ULTIMATE.start_main_~k~5) .cse19 .cse10) (and .cse0 .cse24 .cse9 .cse35) (and .cse0 .cse13 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse7 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse40 .cse4 .cse39 .cse5) (and .cse0 .cse19 .cse16 (<= 59 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse14 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse4 .cse38 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 32 ULTIMATE.start_main_~k~5) .cse9 .cse34) (and .cse0 .cse40 .cse4 .cse8) (and .cse0 .cse30 (<= 21 ULTIMATE.start_main_~k~5) .cse37 .cse4) (and .cse0 (<= 65 ULTIMATE.start_main_~k~5) .cse1 .cse15) (and (and .cse20 .cse33) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 .cse34 (<= 52 ULTIMATE.start_main_~k~5))))) [2018-12-03 18:52:46,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-12-03 18:52:46,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-12-03 18:52:46,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-12-03 18:52:46,943 INFO L444 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-12-03 18:52:46,943 INFO L444 ceAbstractionStarter]: At program point L70(lines 33 70) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-12-03 18:52:46,993 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:52:46 BoogieIcfgContainer [2018-12-03 18:52:46,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:52:46,996 INFO L168 Benchmark]: Toolchain (without parser) took 280881.14 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -38.1 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 18:52:46,997 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-03 18:52:46,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.01 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-03 18:52:46,998 INFO L168 Benchmark]: Boogie Preprocessor took 25.26 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-03 18:52:47,000 INFO L168 Benchmark]: RCFGBuilder took 347.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 18:52:47,001 INFO L168 Benchmark]: TraceAbstraction took 280465.09 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -59.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 18:52:47,008 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.19 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 37.01 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 25.26 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 347.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 280465.09 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -59.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 4) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 3 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 3) && 39 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && main_~i~5 <= 6) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5) && 100 <= main_~k~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 4)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 78 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 34 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 60 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 38 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 69 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 54 <= main_~k~5) && main_~i~5 <= 5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || (92 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 76 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 4) && 10 <= main_~m~5 && main_~j~5 <= 9) && 49 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 47 <= main_~k~5) && main_~i~5 <= 4)) || (99 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 6) && 63 <= main_~k~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 64 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 82 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 3) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 3) && 36 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 42 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 55 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 4) && 44 <= main_~k~5)) || (((10 <= main_~n~5 && 48 <= main_~k~5) && main_~i~5 <= 4) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 6) && 26 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 28 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 79 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 43 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1 && 10 <= main_~m~5) && 31 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 3) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 9) && 59 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 2) && 22 <= main_~k~5)) || (((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 280.3s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 255.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 400 SDslu, 431 SDs, 0 SdLazy, 658 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1625 GetRequests, 1178 SyntacticMatches, 61 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2985 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5119 NumberOfFragments, 1940 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2339026 FormulaSimplificationTreeSizeReduction, 124.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 391445 FormulaSimplificationTreeSizeReductionInter, 131.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 791047 SizeOfPredicates, 36 NumberOfNonLiveVariables, 3453 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 14938/59577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...