java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:22:03,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:22:03,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:22:03,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:22:03,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:22:03,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:22:03,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:22:03,757 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:22:03,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:22:03,761 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:22:03,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:22:03,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:22:03,765 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:22:03,766 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:22:03,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:22:03,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:22:03,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:22:03,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:22:03,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:22:03,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:22:03,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:22:03,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:22:03,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:22:03,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:22:03,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:22:03,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:22:03,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:22:03,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:22:03,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:22:03,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:22:03,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:22:03,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:22:03,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:22:03,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:22:03,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:22:03,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:22:03,807 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:22:03,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:22:03,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:22:03,828 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:22:03,828 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:22:03,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:22:03,829 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:22:03,829 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:22:03,829 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:22:03,829 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:22:03,830 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:22:03,830 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:22:03,830 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:22:03,830 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:22:03,830 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:22:03,830 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:22:03,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:22:03,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:22:03,832 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:22:03,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:22:03,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:22:03,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:22:03,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:22:03,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:22:03,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:22:03,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:22:03,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:22:03,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:22:03,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:22:03,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:22:03,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:22:03,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:22:03,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:22:03,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:03,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:22:03,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:22:03,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:22:03,836 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:22:03,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:22:03,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:22:03,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:22:03,837 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:22:03,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:22:03,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:22:03,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:22:03,888 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:22:03,889 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:22:03,890 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 15:22:03,890 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-12-03 15:22:03,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:22:03,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:22:03,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:03,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:22:03,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:22:03,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:03,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:04,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:22:04,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:22:04,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:22:04,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/1) ... [2018-12-03 15:22:04,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:22:04,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:22:04,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:22:04,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:22:04,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (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 15:22:04,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:22:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:22:04,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:22:04,693 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:22:04,693 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:22:04,694 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:04 BoogieIcfgContainer [2018-12-03 15:22:04,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:22:04,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:22:04,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:22:04,699 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:22:04,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:03" (1/2) ... [2018-12-03 15:22:04,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a10643 and model type pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:22:04, skipping insertion in model container [2018-12-03 15:22:04,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:04" (2/2) ... [2018-12-03 15:22:04,702 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 15:22:04,712 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:22:04,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:22:04,738 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:22:04,769 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:22:04,769 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:22:04,769 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:22:04,769 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:22:04,770 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:22:04,770 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:22:04,770 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:22:04,770 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:22:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 15:22:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:04,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:04,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:04,795 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:04,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 15:22:04,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,006 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 15:22:05,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:05,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:05,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:05,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:05,029 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 15:22:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,087 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-12-03 15:22:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:05,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,099 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:22:05,099 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:22:05,103 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 15:22:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:22:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:22:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:22:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-03 15:22:05,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-12-03 15:22:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,142 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-03 15:22:05,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-12-03 15:22:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:05,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,144 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2078913255, now seen corresponding path program 1 times [2018-12-03 15:22:05,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,215 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 15:22:05,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:05,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:05,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:05,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:05,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:05,220 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-12-03 15:22:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,276 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2018-12-03 15:22:05,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:05,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,280 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:22:05,281 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:22:05,283 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 15:22:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:22:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-03 15:22:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:22:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-03 15:22:05,296 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 14 [2018-12-03 15:22:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,297 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-03 15:22:05,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-03 15:22:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:05,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,298 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2136171557, now seen corresponding path program 1 times [2018-12-03 15:22:05,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,456 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 15:22:05,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:05,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:05,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:05,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:05,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:05,458 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 4 states. [2018-12-03 15:22:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,628 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-12-03 15:22:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:05,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,630 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:22:05,630 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:22:05,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:22:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:22:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 37. [2018-12-03 15:22:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:22:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-12-03 15:22:05,646 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 14 [2018-12-03 15:22:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,646 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-03 15:22:05,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-12-03 15:22:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:05,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,648 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2136111975, now seen corresponding path program 1 times [2018-12-03 15:22:05,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,792 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 15:22:05,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:05,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:05,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:05,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:05,794 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 4 states. [2018-12-03 15:22:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,926 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-12-03 15:22:05,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:05,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,928 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:22:05,929 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:22:05,930 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 15:22:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:22:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2018-12-03 15:22:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:22:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-12-03 15:22:05,946 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 14 [2018-12-03 15:22:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,947 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-12-03 15:22:05,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-12-03 15:22:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:05,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,953 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1820688235, now seen corresponding path program 1 times [2018-12-03 15:22:05,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,065 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 15:22:06,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:06,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:06,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:06,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:06,068 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 3 states. [2018-12-03 15:22:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,115 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-12-03 15:22:06,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:06,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,116 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:22:06,117 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:22:06,117 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 15:22:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:22:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:22:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:22:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-12-03 15:22:06,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 14 [2018-12-03 15:22:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,126 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-03 15:22:06,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-12-03 15:22:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:06,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,128 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 15:22:06,128 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1912016391, now seen corresponding path program 1 times [2018-12-03 15:22:06,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,235 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 15:22:06,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:22:06,236 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:06,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:06,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:06,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:06,237 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 3 states. [2018-12-03 15:22:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,286 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2018-12-03 15:22:06,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:06,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:22:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,288 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:22:06,288 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:22:06,289 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 15:22:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:22:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-03 15:22:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:22:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2018-12-03 15:22:06,305 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 26 [2018-12-03 15:22:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,306 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-12-03 15:22:06,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-12-03 15:22:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:06,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,308 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 15:22:06,308 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1573604279, now seen corresponding path program 1 times [2018-12-03 15:22:06,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:06,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:06,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:06,632 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:22:06,634 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 15:22:06,677 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:22:06,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:22:07,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:22:07,617 INFO L272 AbstractInterpreter]: Visited 20 different actions 118 times. Merged at 19 different actions 70 times. Widened at 6 different actions 11 times. Found 23 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 15:22:07,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:07,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:22:07,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:07,663 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 15:22:07,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:07,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:07,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:07,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:07,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:07,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2018-12-03 15:22:07,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:07,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:22:07,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:22:07,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:22:07,906 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 7 states. [2018-12-03 15:22:08,581 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:22:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,139 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-12-03 15:22:09,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:22:09,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 15:22:09,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,143 INFO L225 Difference]: With dead ends: 257 [2018-12-03 15:22:09,143 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 15:22:09,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:22:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 15:22:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2018-12-03 15:22:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 15:22:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2018-12-03 15:22:09,177 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 26 [2018-12-03 15:22:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,178 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2018-12-03 15:22:09,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:22:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2018-12-03 15:22:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:22:09,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:09,180 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:09,180 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:09,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash -53844841, now seen corresponding path program 2 times [2018-12-03 15:22:09,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:09,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:09,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 15:22:09,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:09,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:09,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:09,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:09,260 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand 3 states. [2018-12-03 15:22:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,267 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2018-12-03 15:22:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:09,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 15:22:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,268 INFO L225 Difference]: With dead ends: 145 [2018-12-03 15:22:09,268 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:22:09,269 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 15:22:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:22:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:22:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:22:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:22:09,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-12-03 15:22:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,270 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:22:09,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:22:09,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:22:09,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:22:09,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:09,672 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 15:22:09,833 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 15:22:10,156 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-12-03 15:22:10,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 316) no Hoare annotation was computed. [2018-12-03 15:22:10,233 INFO L444 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0)))) [2018-12-03 15:22:10,234 INFO L444 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-12-03 15:22:10,234 INFO L444 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (let ((.cse0 (not (= (+ ~p2_old 1) 0))) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~p2_new))) (or (and .cse0 (<= 1 ~mode3) .cse1) (and (<= ~r1 0) .cse1 (= ~mode3 0) .cse2) (and (<= ~r1 1) .cse0 .cse1 .cse2))) [2018-12-03 15:22:10,234 INFO L444 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-12-03 15:22:10,234 INFO L444 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-12-03 15:22:10,235 INFO L444 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (<= 1 ULTIMATE.start_main_~c1~82) (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-12-03 15:22:10,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 316) no Hoare annotation was computed. [2018-12-03 15:22:10,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 316) no Hoare annotation was computed. [2018-12-03 15:22:10,235 INFO L444 ceAbstractionStarter]: At program point L313(lines 192 313) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-12-03 15:22:10,236 INFO L444 ceAbstractionStarter]: At program point L214(lines 205 215) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0)))) [2018-12-03 15:22:10,236 INFO L444 ceAbstractionStarter]: At program point L243(lines 243 252) the Hoare annotation is: (let ((.cse0 (not (= (+ ~p2_old 1) 0))) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~p2_new))) (or (and .cse0 (<= 1 ~mode3) .cse1) (and (<= ~r1 0) .cse1 (= ~mode3 0) .cse2) (and (<= ~r1 1) .cse0 .cse1 .cse2))) [2018-12-03 15:22:10,236 INFO L444 ceAbstractionStarter]: At program point L307(lines 307 314) the Hoare annotation is: false [2018-12-03 15:22:10,236 INFO L444 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (and (<= ~r1 1) (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-12-03 15:22:10,236 INFO L444 ceAbstractionStarter]: At program point L198(lines 198 206) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p2_old 1) 0)) (<= 1 ~mode3) .cse0 (<= 1 ULTIMATE.start_assert_~arg)) (and (<= ~r1 0) (<= 256 ~mode2) .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-12-03 15:22:10,237 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 315) no Hoare annotation was computed. [2018-12-03 15:22:10,237 INFO L444 ceAbstractionStarter]: At program point L258(lines 251 259) the Hoare annotation is: (and (<= ~r1 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 0 ~p2_new)) [2018-12-03 15:22:10,251 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:22:10 BoogieIcfgContainer [2018-12-03 15:22:10,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:22:10,253 INFO L168 Benchmark]: Toolchain (without parser) took 6300.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 673.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -441.1 MB). Peak memory consumption was 232.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:10,254 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:10,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:10,255 INFO L168 Benchmark]: Boogie Preprocessor took 57.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:10,256 INFO L168 Benchmark]: RCFGBuilder took 632.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:10,257 INFO L168 Benchmark]: TraceAbstraction took 5556.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 673.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -472.8 MB). Peak memory consumption was 200.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:10,261 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 632.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5556.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 673.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -472.8 MB). Peak memory consumption was 200.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 315]: 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: 192]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) || ((((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) || (((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) || ((((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((~r1 <= 0 && 0 == ~nomsg + 1) && ~mode3 == 0) && 0 <= ~p2_new)) || (((~r1 <= 1 && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 0 <= ~p2_new) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_#in~arg - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((1 <= check_~tmp~75 && 1 <= main_~c1~82) && !(~p2_old + 1 == 0)) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) || (((~r1 <= 0 && 256 <= ~mode2) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((~r1 <= 1 && 1 <= ~mode3) && 0 == ~nomsg + 1) && 0 <= ~p2_new - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((~r1 <= 0 && 0 == ~nomsg + 1) && ~mode3 == 0) && 0 <= ~p2_new)) || (((~r1 <= 1 && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 0 <= ~p2_new) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((~r1 <= 1 && !(~p2_old + 1 == 0)) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((!(~p2_old + 1 == 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= assert_#in~arg - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((1 <= check_~tmp~75 && !(~p2_old + 1 == 0)) && 1 <= ~mode3) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 191 SDslu, 201 SDs, 0 SdLazy, 116 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 65 NumberOfFragments, 352 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1740 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 12251 SizeOfPredicates, 1 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 70/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...