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_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:56:20,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:56:20,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:56:20,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:56:20,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:56:20,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:56:20,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:56:20,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:56:20,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:56:20,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:56:20,354 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:56:20,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:56:20,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:56:20,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:56:20,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:56:20,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:56:20,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:56:20,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:56:20,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:56:20,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:56:20,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:56:20,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:56:20,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:56:20,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:56:20,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:56:20,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:56:20,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:56:20,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:56:20,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:56:20,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:56:20,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:56:20,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:56:20,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:56:20,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:56:20,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:56:20,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:56:20,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:56:20,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:56:20,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:56:20,427 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:56:20,428 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:56:20,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:56:20,428 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:56:20,428 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:56:20,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:56:20,429 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:56:20,429 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:56:20,429 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:56:20,429 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:56:20,430 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:56:20,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:56:20,431 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:56:20,431 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:56:20,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:56:20,432 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:56:20,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:56:20,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:56:20,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:56:20,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:56:20,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:56:20,434 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:56:20,434 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:56:20,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:56:20,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:56:20,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:56:20,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:56:20,436 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:56:20,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:56:20,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:56:20,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:56:20,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:56:20,437 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:56:20,437 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:56:20,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:56:20,437 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:56:20,437 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:56:20,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:56:20,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:56:20,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:56:20,510 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:56:20,511 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:56:20,512 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.6.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 17:56:20,512 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl' [2018-12-03 17:56:20,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:56:20,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:56:20,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:56:20,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:56:20,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:56:20,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:56:20,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:56:20,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:56:20,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:56:20,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/1) ... [2018-12-03 17:56:20,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:56:20,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:56:20,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:56:20,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:56:20,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (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 17:56:20,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:56:20,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:56:21,502 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:56:21,502 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:56:21,503 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:21 BoogieIcfgContainer [2018-12-03 17:56:21,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:56:21,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:56:21,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:56:21,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:56:21,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:20" (1/2) ... [2018-12-03 17:56:21,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34124d41 and model type pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:56:21, skipping insertion in model container [2018-12-03 17:56:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:21" (2/2) ... [2018-12-03 17:56:21,512 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl [2018-12-03 17:56:21,521 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:56:21,529 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:56:21,548 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:56:21,583 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:56:21,583 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:56:21,584 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:56:21,584 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:56:21,584 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:56:21,584 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:56:21,584 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:56:21,585 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:56:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 17:56:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:21,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:21,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:21,612 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:21,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 17:56:21,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:21,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:21,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:21,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:21,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:21,924 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 17:56:21,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:21,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:21,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:21,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:21,949 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 17:56:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:22,007 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 17:56:22,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:22,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:22,025 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:56:22,025 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:56:22,032 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 17:56:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:56:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 17:56:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:56:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 17:56:22,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 17:56:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:22,078 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 17:56:22,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 17:56:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:22,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:22,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:22,080 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:22,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:22,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 17:56:22,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:22,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:22,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:22,239 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 17:56:22,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:22,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:22,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:22,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:22,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:22,244 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 17:56:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:22,294 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 17:56:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:22,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:22,297 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:56:22,297 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:56:22,299 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 17:56:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:56:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 17:56:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:56:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 17:56:22,319 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 17:56:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:22,320 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 17:56:22,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 17:56:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:22,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:22,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:22,322 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:22,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:22,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 17:56:22,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:22,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:22,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:22,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:22,608 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-12-03 17:56:22,610 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 17:56:22,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:22,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:56:22,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:22,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:56:22,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:56:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:56:22,620 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-12-03 17:56:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:22,842 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-12-03 17:56:22,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:56:22,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 17:56:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:22,849 INFO L225 Difference]: With dead ends: 141 [2018-12-03 17:56:22,849 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 17:56:22,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:56:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 17:56:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-12-03 17:56:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:56:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-03 17:56:22,889 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-12-03 17:56:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:22,890 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-03 17:56:22,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:56:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-03 17:56:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:56:22,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:22,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:22,892 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:22,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:22,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-12-03 17:56:22,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:22,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:22,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:22,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:23,034 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 17:56:23,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:23,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:23,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:23,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:23,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:23,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:23,036 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-12-03 17:56:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:23,094 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-12-03 17:56:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:23,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 17:56:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:23,097 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:56:23,097 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:56:23,099 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 17:56:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:56:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:56:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:56:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-12-03 17:56:23,127 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-12-03 17:56:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:23,128 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-12-03 17:56:23,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-12-03 17:56:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:23,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:23,129 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:23,130 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:23,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-12-03 17:56:23,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:23,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:23,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:23,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:23,433 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:23,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:23,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:23,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:23,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:23,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:23,441 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-12-03 17:56:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:23,535 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-12-03 17:56:23,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:23,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:23,540 INFO L225 Difference]: With dead ends: 321 [2018-12-03 17:56:23,544 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 17:56:23,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 17:56:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 17:56:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 17:56:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 17:56:23,621 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-12-03 17:56:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:23,625 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 17:56:23,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 17:56:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:23,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:23,628 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:23,628 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:23,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-12-03 17:56:23,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:23,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:23,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:23,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:23,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:23,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:23,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:23,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:23,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:23,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:23,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:23,823 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 17:56:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:23,930 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 17:56:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:23,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:23,934 INFO L225 Difference]: With dead ends: 633 [2018-12-03 17:56:23,934 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 17:56:23,936 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 17:56:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 17:56:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 17:56:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 17:56:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 17:56:24,013 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 17:56:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:24,014 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 17:56:24,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 17:56:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:24,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:24,017 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:24,017 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:24,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-12-03 17:56:24,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:24,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:24,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:24,272 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:24,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:24,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:24,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:24,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:24,277 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 17:56:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:24,468 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 17:56:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:24,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:24,474 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 17:56:24,475 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 17:56:24,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 17:56:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 17:56:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 17:56:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 17:56:24,609 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 17:56:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:24,610 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 17:56:24,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 17:56:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:24,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:24,613 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:24,613 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:24,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-12-03 17:56:24,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:24,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:24,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:24,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:24,929 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:24,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:24,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:24,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:24,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:24,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:24,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:24,935 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 17:56:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:25,257 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 17:56:25,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:25,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 17:56:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:25,268 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 17:56:25,268 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 17:56:25,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 17:56:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 17:56:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 17:56:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 17:56:25,515 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 17:56:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:25,516 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 17:56:25,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 17:56:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:56:25,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:25,519 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:25,520 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:25,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:25,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-12-03 17:56:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:25,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:25,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:25,789 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 17:56:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:25,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:56:25,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:56:25,804 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 17:56:25,807 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58], [62], [64], [66] [2018-12-03 17:56:25,872 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:56:25,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:56:27,992 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:58:54,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:58:54,229 INFO L272 AbstractInterpreter]: Visited 26 different actions 645 times. Merged at 25 different actions 451 times. Widened at 23 different actions 273 times. Found 137 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 17:58:54,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:54,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:58:54,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:54,241 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 17:58:54,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:54,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:58:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:54,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:58:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:58:54,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:58:55,124 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 17:58:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:55,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:58:55,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 17:58:55,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:58:55,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:58:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:58:55,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:58:55,336 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 8 states. [2018-12-03 17:58:55,646 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:58:57,025 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:58:57,754 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:58:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:58,036 INFO L93 Difference]: Finished difference Result 3747 states and 4711 transitions. [2018-12-03 17:58:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:58:58,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-03 17:58:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:58,043 INFO L225 Difference]: With dead ends: 3747 [2018-12-03 17:58:58,043 INFO L226 Difference]: Without dead ends: 1353 [2018-12-03 17:58:58,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:58:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2018-12-03 17:58:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1223. [2018-12-03 17:58:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-12-03 17:58:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1452 transitions. [2018-12-03 17:58:58,230 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1452 transitions. Word has length 34 [2018-12-03 17:58:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:58,230 INFO L480 AbstractCegarLoop]: Abstraction has 1223 states and 1452 transitions. [2018-12-03 17:58:58,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:58:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1452 transitions. [2018-12-03 17:58:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:58:58,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:58,233 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:58:58,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:58,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 2 times [2018-12-03 17:58:58,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:58,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:58,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 17:58:58,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:58,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:58:58,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:58,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:58,332 INFO L87 Difference]: Start difference. First operand 1223 states and 1452 transitions. Second operand 3 states. [2018-12-03 17:58:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:58,362 INFO L93 Difference]: Finished difference Result 1223 states and 1452 transitions. [2018-12-03 17:58:58,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:58,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 17:58:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:58,363 INFO L225 Difference]: With dead ends: 1223 [2018-12-03 17:58:58,363 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:58:58,365 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 17:58:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:58:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:58:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:58:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:58:58,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 17:58:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:58,366 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:58:58,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:58:58,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:58:58,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:58:58,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:58,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:58:59,169 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:58:59,302 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:58:59,490 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-03 17:58:59,616 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:58:59,748 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-03 17:59:00,114 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:59:00,422 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-03 17:59:00,542 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:59:00,700 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-03 17:59:00,836 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:59:00,840 INFO L444 ceAbstractionStarter]: At program point L543(lines 366 543) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 17:59:00,840 INFO L444 ceAbstractionStarter]: At program point L510(lines 510 517) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (<= ~r1 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:59:00,840 INFO L444 ceAbstractionStarter]: At program point L477(lines 477 487) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,840 INFO L444 ceAbstractionStarter]: At program point L531(lines 531 538) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (<= ULTIMATE.start_check_~tmp~157 1) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~157)) [2018-12-03 17:59:00,841 INFO L444 ceAbstractionStarter]: At program point L432(lines 426 433) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,841 INFO L444 ceAbstractionStarter]: At program point L457(lines 457 466) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,841 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 545) no Hoare annotation was computed. [2018-12-03 17:59:00,841 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 546) no Hoare annotation was computed. [2018-12-03 17:59:00,841 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 546) no Hoare annotation was computed. [2018-12-03 17:59:00,842 INFO L444 ceAbstractionStarter]: At program point L412(lines 406 413) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,842 INFO L444 ceAbstractionStarter]: At program point L437(lines 437 447) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,842 INFO L444 ceAbstractionStarter]: At program point L392(lines 383 393) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= 1 ~mode2)) (.cse6 (<= .cse7 0)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse5 .cse2 .cse3 .cse6 .cse4) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode2 (* 256 .cse7)) .cse3 .cse4)))) [2018-12-03 17:59:00,842 INFO L444 ceAbstractionStarter]: At program point L417(lines 417 427) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,842 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 546) no Hoare annotation was computed. [2018-12-03 17:59:00,842 INFO L444 ceAbstractionStarter]: At program point L537(lines 537 544) the Hoare annotation is: false [2018-12-03 17:59:00,843 INFO L444 ceAbstractionStarter]: At program point L397(lines 397 407) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= 1 ~mode2)) (.cse6 (<= .cse7 0)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse5 .cse2 .cse3 .cse6 .cse4) (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode2 (* 256 .cse7)) .cse3 .cse4)))) [2018-12-03 17:59:00,843 INFO L444 ceAbstractionStarter]: At program point L492(lines 486 493) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,843 INFO L444 ceAbstractionStarter]: At program point L521(lines 516 522) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (<= ULTIMATE.start_check_~tmp~157 1) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~157)) [2018-12-03 17:59:00,843 INFO L444 ceAbstractionStarter]: At program point L472(lines 465 473) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,843 INFO L444 ceAbstractionStarter]: At program point L373(lines 373 384) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 17:59:00,843 INFO L444 ceAbstractionStarter]: At program point L452(lines 446 453) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= ~r1 1) .cse2 .cse3 .cse4 .cse5) (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:59:00,864 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:59:00 BoogieIcfgContainer [2018-12-03 17:59:00,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:59:00,865 INFO L168 Benchmark]: Toolchain (without parser) took 160243.68 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:59:00,866 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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 17:59:00,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.79 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 17:59:00,867 INFO L168 Benchmark]: Boogie Preprocessor took 67.64 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 17:59:00,868 INFO L168 Benchmark]: RCFGBuilder took 751.92 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-03 17:59:00,869 INFO L168 Benchmark]: TraceAbstraction took 159359.61 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:59:00,873 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 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 59.79 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 67.64 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 751.92 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159359.61 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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: 446]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && check_~tmp~157 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~157 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && check_~tmp~157 <= 1) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~157 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 426]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((~r1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 159.2s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 337 SDtfs, 302 SDslu, 276 SDs, 0 SdLazy, 202 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1669occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 148.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 206 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 749 NumberOfFragments, 1125 HoareAnnotationTreeSize, 17 FomulaSimplifications, 44021 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 17 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 48334 SizeOfPredicates, 7 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 180/208 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...