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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:41:51,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:41:51,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:41:51,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:41:51,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:41:51,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:41:51,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:41:51,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:41:51,589 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:41:51,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:41:51,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:41:51,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:41:51,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:41:51,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:41:51,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:41:51,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:41:51,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:41:51,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:41:51,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:41:51,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:41:51,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:41:51,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:41:51,617 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:41:51,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:41:51,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:41:51,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:41:51,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:41:51,620 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:41:51,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:41:51,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:41:51,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:41:51,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:41:51,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:41:51,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:41:51,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:41:51,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:41:51,626 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:41:51,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:41:51,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:41:51,651 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:41:51,652 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:41:51,652 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:41:51,652 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:41:51,652 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:41:51,652 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:41:51,652 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:41:51,655 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:41:51,655 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:41:51,655 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:41:51,655 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:41:51,655 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:41:51,656 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:41:51,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:41:51,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:41:51,657 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:41:51,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:41:51,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:41:51,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:41:51,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:41:51,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:41:51,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:41:51,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:41:51,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:41:51,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:41:51,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:41:51,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:41:51,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:41:51,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:41:51,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:41:51,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:41:51,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:41:51,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:41:51,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:41:51,663 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:41:51,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:41:51,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:41:51,663 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:41:51,663 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:41:51,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:41:51,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:41:51,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:41:51,722 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:41:51,723 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:41:51,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 16:41:51,724 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl' [2018-12-03 16:41:51,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:41:51,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:41:51,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:51,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:41:51,793 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:41:51,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:51,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:41:51,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:41:51,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:41:51,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/1) ... [2018-12-03 16:41:51,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:41:51,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:41:51,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:41:51,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:41:51,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (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 16:41:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:41:51,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:41:52,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:41:52,516 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:41:52,516 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:52 BoogieIcfgContainer [2018-12-03 16:41:52,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:41:52,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:41:52,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:41:52,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:41:52,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:51" (1/2) ... [2018-12-03 16:41:52,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ece261 and model type pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:41:52, skipping insertion in model container [2018-12-03 16:41:52,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:52" (2/2) ... [2018-12-03 16:41:52,524 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 16:41:52,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:41:52,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:41:52,561 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:41:52,597 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:41:52,597 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:41:52,597 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:41:52,597 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:41:52,597 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:41:52,598 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:41:52,598 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:41:52,598 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:41:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 16:41:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:41:52,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:52,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:52,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:52,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 16:41:52,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:52,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:52,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:52,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:52,877 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 16:41:52,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:52,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:52,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:52,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:52,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:52,899 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 16:41:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:52,948 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 16:41:52,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:52,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:41:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:52,961 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:41:52,962 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:41:52,966 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 16:41:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:41:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 16:41:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:41:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 16:41:53,010 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 16:41:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:53,010 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 16:41:53,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 16:41:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:41:53,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:53,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:53,012 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:53,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 16:41:53,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:53,152 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 16:41:53,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:53,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:53,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:53,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:53,156 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 16:41:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:53,204 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 16:41:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:53,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:41:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:53,211 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:41:53,211 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:41:53,212 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 16:41:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:41:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 16:41:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:41:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 16:41:53,241 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 16:41:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:53,242 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 16:41:53,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 16:41:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:41:53,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:53,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:53,245 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:53,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:53,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 16:41:53,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:53,434 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 16:41:53,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:53,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:41:53,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:53,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:41:53,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:41:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:41:53,436 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 16:41:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:53,608 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 16:41:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:41:53,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 16:41:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:53,617 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:41:53,617 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:41:53,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:41:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:41:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 16:41:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:41:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 16:41:53,660 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 16:41:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:53,661 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 16:41:53,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:41:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 16:41:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:41:53,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:53,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:53,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:53,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 16:41:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:53,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:53,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:53,777 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 16:41:53,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:53,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:53,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:53,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:53,780 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 16:41:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:53,848 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 16:41:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:53,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:41:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:53,851 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:41:53,851 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:41:53,854 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 16:41:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:41:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:41:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:41:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 16:41:53,894 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 16:41:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:53,894 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 16:41:53,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 16:41:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:41:53,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:53,896 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:53,896 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:53,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 16:41:53,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:53,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:54,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:54,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:41:54,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:54,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:54,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:54,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:54,076 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 16:41:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:54,174 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 16:41:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:54,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:41:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:54,188 INFO L225 Difference]: With dead ends: 249 [2018-12-03 16:41:54,188 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:41:54,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:41:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:41:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 16:41:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:41:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 16:41:54,242 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 16:41:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:54,243 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 16:41:54,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 16:41:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:41:54,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:54,245 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:54,245 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:54,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 16:41:54,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:54,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:54,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:54,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:54,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:41:54,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:54,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:54,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:54,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:54,382 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 16:41:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:54,485 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 16:41:54,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:54,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:41:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:54,488 INFO L225 Difference]: With dead ends: 489 [2018-12-03 16:41:54,488 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 16:41:54,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:41:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 16:41:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 16:41:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 16:41:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 16:41:54,558 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 16:41:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:54,559 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 16:41:54,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 16:41:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:41:54,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:54,562 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:41:54,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:54,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 16:41:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:54,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:54,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:54,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:54,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:55,046 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 16:41:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:55,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:55,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:55,190 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 16:41:55,192 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 16:41:55,270 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:41:55,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:41:56,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:41:56,541 INFO L272 AbstractInterpreter]: Visited 20 different actions 131 times. Merged at 19 different actions 81 times. Widened at 12 different actions 18 times. Found 29 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 16:41:56,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:56,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:41:56,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:56,591 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 16:41:56,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:56,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:56,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:41:56,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:41:57,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:57,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 16:41:57,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:57,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:41:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:41:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:41:57,103 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 8 states. [2018-12-03 16:41:57,334 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 16:41:58,561 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 16:41:58,892 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 16:41:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:59,499 INFO L93 Difference]: Finished difference Result 767 states and 960 transitions. [2018-12-03 16:41:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:41:59,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 16:41:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:59,505 INFO L225 Difference]: With dead ends: 767 [2018-12-03 16:41:59,506 INFO L226 Difference]: Without dead ends: 299 [2018-12-03 16:41:59,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:41:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-03 16:41:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 267. [2018-12-03 16:41:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 16:41:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 308 transitions. [2018-12-03 16:41:59,561 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 308 transitions. Word has length 26 [2018-12-03 16:41:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:59,562 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 308 transitions. [2018-12-03 16:41:59,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:41:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2018-12-03 16:41:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:41:59,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:59,565 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:41:59,565 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:59,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:59,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1932160773, now seen corresponding path program 2 times [2018-12-03 16:41:59,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:59,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:59,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 16:41:59,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:59,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:59,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:59,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:59,690 INFO L87 Difference]: Start difference. First operand 267 states and 308 transitions. Second operand 3 states. [2018-12-03 16:41:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:59,704 INFO L93 Difference]: Finished difference Result 277 states and 319 transitions. [2018-12-03 16:41:59,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:59,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:41:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:59,705 INFO L225 Difference]: With dead ends: 277 [2018-12-03 16:41:59,705 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:41:59,706 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 16:41:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:41:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:41:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:41:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:41:59,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 16:41:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:59,708 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:41:59,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:41:59,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:41:59,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:41:59,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:59,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:59,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:59,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:00,159 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 16:42:00,289 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 16:42:00,558 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 16:42:00,817 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-03 16:42:00,942 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 16:42:01,281 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 16:42:01,464 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-03 16:42:01,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 391) no Hoare annotation was computed. [2018-12-03 16:42:01,468 INFO L444 ceAbstractionStarter]: At program point L382(lines 382 389) the Hoare annotation is: false [2018-12-03 16:42:01,468 INFO L444 ceAbstractionStarter]: At program point L283(lines 283 293) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:42:01,468 INFO L444 ceAbstractionStarter]: At program point L376(lines 376 383) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ULTIMATE.start_check_~tmp~102) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:42:01,469 INFO L444 ceAbstractionStarter]: At program point L341(lines 335 342) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and .cse0 (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~r1 1) .cse3 .cse4 .cse5 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:42:01,469 INFO L444 ceAbstractionStarter]: At program point L366(lines 361 367) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 1 ULTIMATE.start_check_~tmp~102) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:42:01,469 INFO L444 ceAbstractionStarter]: At program point L298(lines 292 299) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:42:01,469 INFO L444 ceAbstractionStarter]: At program point L321(lines 312 322) the Hoare annotation is: (let ((.cse5 (div ~mode4 256))) (let ((.cse6 (<= .cse5 0)) (.cse0 (<= ~send3 127)) (.cse7 (<= 1 ~mode4)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4) (and (= ~r1 0) .cse0 .cse1 .cse2 (= ~mode4 (* 256 .cse5)) .cse3) (and .cse6 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 16:42:01,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 391) no Hoare annotation was computed. [2018-12-03 16:42:01,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 391) no Hoare annotation was computed. [2018-12-03 16:42:01,470 INFO L444 ceAbstractionStarter]: At program point L278(lines 272 279) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:42:01,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-12-03 16:42:01,470 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 313) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:42:01,471 INFO L444 ceAbstractionStarter]: At program point L262(lines 262 273) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:42:01,471 INFO L444 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (let ((.cse5 (div ~mode4 256))) (let ((.cse6 (<= .cse5 0)) (.cse0 (<= ~send3 127)) (.cse7 (<= 1 ~mode4)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4) (and (= ~r1 0) .cse0 .cse1 .cse2 (= ~mode4 (* 256 .cse5)) .cse3) (and .cse6 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4)))) [2018-12-03 16:42:01,471 INFO L444 ceAbstractionStarter]: At program point L388(lines 255 388) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 16:42:01,471 INFO L444 ceAbstractionStarter]: At program point L355(lines 355 362) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= ~r1 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 16:42:01,489 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:01 BoogieIcfgContainer [2018-12-03 16:42:01,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:01,490 INFO L168 Benchmark]: Toolchain (without parser) took 9702.98 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -221.0 MB). Peak memory consumption was 479.9 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:01,492 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 16:42:01,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.84 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 16:42:01,493 INFO L168 Benchmark]: Boogie Preprocessor took 34.98 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 16:42:01,494 INFO L168 Benchmark]: RCFGBuilder took 626.34 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:01,495 INFO L168 Benchmark]: TraceAbstraction took 8971.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -263.3 MB). Peak memory consumption was 437.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:01,499 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.20 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 61.84 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 34.98 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 626.34 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8971.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -263.3 MB). Peak memory consumption was 437.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 255]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 1 <= check_~tmp~102) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= check_~tmp~102) && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && ~r1 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 200 SDtfs, 171 SDslu, 181 SDs, 0 SdLazy, 168 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 88 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 171 NumberOfFragments, 700 HoareAnnotationTreeSize, 13 FomulaSimplifications, 6555 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 116 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 23490 SizeOfPredicates, 9 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 108/132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...