java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:19:56,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:19:56,384 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:19:56,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:19:56,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:19:56,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:19:56,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:19:56,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:19:56,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:19:56,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:19:56,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:19:56,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:19:56,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:19:56,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:19:56,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:19:56,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:19:56,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:19:56,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:19:56,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:19:56,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:19:56,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:19:56,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:19:56,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:19:56,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:19:56,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:19:56,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:19:56,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:19:56,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:19:56,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:19:56,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:19:56,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:19:56,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:19:56,432 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:19:56,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:19:56,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:19:56,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:19:56,436 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:19:56,459 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:19:56,459 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:19:56,463 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:19:56,463 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:19:56,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:19:56,463 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:19:56,463 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:19:56,464 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:19:56,464 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:19:56,464 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:19:56,464 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:19:56,464 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:19:56,464 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:19:56,465 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:19:56,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:19:56,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:19:56,466 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:19:56,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:19:56,466 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:19:56,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:19:56,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:19:56,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:19:56,469 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:19:56,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:19:56,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:19:56,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:19:56,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:19:56,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:19:56,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:19:56,470 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:19:56,470 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:19:56,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:19:56,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:19:56,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:19:56,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:19:56,471 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:19:56,471 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:19:56,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:19:56,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:19:56,472 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:19:56,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:19:56,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:19:56,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:19:56,545 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:19:56,546 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:19:56,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-12-03 19:19:56,548 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-12-03 19:19:56,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:19:56,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:19:56,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:19:56,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:19:56,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:19:56,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:19:56,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:19:56,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:19:56,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:19:56,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/1) ... [2018-12-03 19:19:56,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:19:56,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:19:56,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:19:56,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:19:56,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (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 19:19:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:19:56,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:19:57,467 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:19:57,468 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:19:57,468 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:19:57 BoogieIcfgContainer [2018-12-03 19:19:57,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:19:57,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:19:57,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:19:57,473 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:19:57,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:19:56" (1/2) ... [2018-12-03 19:19:57,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33287c7a and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:19:57, skipping insertion in model container [2018-12-03 19:19:57,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:19:57" (2/2) ... [2018-12-03 19:19:57,476 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-12-03 19:19:57,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:19:57,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:19:57,514 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:19:57,549 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:19:57,549 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:19:57,549 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:19:57,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:19:57,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:19:57,550 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:19:57,550 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:19:57,550 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:19:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 19:19:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 19:19:57,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:19:57,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:19:57,584 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:19:57,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:19:57,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-12-03 19:19:57,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:19:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:57,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:19:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:57,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:19:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:19:57,805 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 19:19:57,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:19:57,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:19:57,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:19:57,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:19:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:19:57,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:19:57,826 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 19:19:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:19:58,013 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-12-03 19:19:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:19:58,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 19:19:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:19:58,030 INFO L225 Difference]: With dead ends: 37 [2018-12-03 19:19:58,031 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 19:19:58,035 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 19:19:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 19:19:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 19:19:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 19:19:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-12-03 19:19:58,078 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-12-03 19:19:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:19:58,079 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-03 19:19:58,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:19:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-12-03 19:19:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 19:19:58,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:19:58,080 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:19:58,081 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:19:58,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:19:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-12-03 19:19:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:19:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:58,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:19:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:58,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:19:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:19:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:19:58,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:19:58,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:19:58,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:19:58,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:19:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:19:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:19:58,200 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-12-03 19:19:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:19:58,479 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-12-03 19:19:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:19:58,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 19:19:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:19:58,481 INFO L225 Difference]: With dead ends: 41 [2018-12-03 19:19:58,481 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 19:19:58,483 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 19:19:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 19:19:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 19:19:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 19:19:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-12-03 19:19:58,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-12-03 19:19:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:19:58,490 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-12-03 19:19:58,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:19:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-12-03 19:19:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 19:19:58,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:19:58,492 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:19:58,493 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:19:58,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:19:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-12-03 19:19:58,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:19:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:58,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:19:58,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:58,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:19:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:19:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:19:58,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:19:58,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:19:58,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:19:58,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:19:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:19:58,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:19:58,657 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-12-03 19:19:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:19:58,837 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-12-03 19:19:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:19:58,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 19:19:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:19:58,840 INFO L225 Difference]: With dead ends: 50 [2018-12-03 19:19:58,840 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 19:19:58,841 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 19:19:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 19:19:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 19:19:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 19:19:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-12-03 19:19:58,855 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-12-03 19:19:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:19:58,855 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-12-03 19:19:58,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:19:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-12-03 19:19:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 19:19:58,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:19:58,857 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:19:58,857 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:19:58,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:19:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-12-03 19:19:58,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:19:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:58,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:19:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:58,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:19:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:19:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 19:19:58,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:19:58,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:19:58,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:19:58,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:19:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:19:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:19:58,954 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-12-03 19:19:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:19:59,098 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-12-03 19:19:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:19:59,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 19:19:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:19:59,100 INFO L225 Difference]: With dead ends: 74 [2018-12-03 19:19:59,100 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 19:19:59,101 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 19:19:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 19:19:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-03 19:19:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 19:19:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-12-03 19:19:59,112 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-12-03 19:19:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:19:59,113 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-12-03 19:19:59,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:19:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-12-03 19:19:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:19:59,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:19:59,114 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:19:59,115 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:19:59,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:19:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-12-03 19:19:59,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:19:59,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:59,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:19:59,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:59,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:19:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:19:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 19:19:59,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:19:59,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:19:59,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:19:59,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:19:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:19:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:19:59,266 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-12-03 19:19:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:19:59,409 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-12-03 19:19:59,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:19:59,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 19:19:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:19:59,411 INFO L225 Difference]: With dead ends: 92 [2018-12-03 19:19:59,411 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 19:19:59,412 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 19:19:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 19:19:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 19:19:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 19:19:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-12-03 19:19:59,423 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-12-03 19:19:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:19:59,423 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-12-03 19:19:59,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:19:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-12-03 19:19:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 19:19:59,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:19:59,428 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:19:59,428 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:19:59,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:19:59,430 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-12-03 19:19:59,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:19:59,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:19:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:59,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:19:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:19:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 19:19:59,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:19:59,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:19:59,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:19:59,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:19:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:19:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:19:59,536 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-12-03 19:19:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:19:59,607 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-12-03 19:19:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:19:59,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 19:19:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:19:59,611 INFO L225 Difference]: With dead ends: 71 [2018-12-03 19:19:59,611 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 19:19:59,612 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 19:19:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 19:19:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-12-03 19:19:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 19:19:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-12-03 19:19:59,624 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-12-03 19:19:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:19:59,625 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-12-03 19:19:59,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:19:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-12-03 19:19:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 19:19:59,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:19:59,627 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:19:59,627 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:19:59,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:19:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-12-03 19:19:59,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:19:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:59,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:19:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:19:59,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:19:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:19:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 19:19:59,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:19:59,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:19:59,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:19:59,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:19:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:19:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:19:59,737 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-12-03 19:20:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:20:00,006 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-12-03 19:20:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:20:00,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 19:20:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:20:00,011 INFO L225 Difference]: With dead ends: 161 [2018-12-03 19:20:00,011 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 19:20:00,012 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 19:20:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 19:20:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 19:20:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 19:20:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-12-03 19:20:00,027 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-12-03 19:20:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:20:00,028 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-12-03 19:20:00,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:20:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-12-03 19:20:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 19:20:00,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:20:00,030 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:20:00,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:20:00,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:20:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-12-03 19:20:00,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:20:00,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:00,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:20:00,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:00,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:20:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:20:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 19:20:00,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:20:00,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:20:00,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:20:00,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:20:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:20:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:20:00,115 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-12-03 19:20:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:20:00,421 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-12-03 19:20:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:20:00,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 19:20:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:20:00,423 INFO L225 Difference]: With dead ends: 205 [2018-12-03 19:20:00,423 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 19:20:00,424 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 19:20:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 19:20:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 19:20:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 19:20:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-12-03 19:20:00,441 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-12-03 19:20:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:20:00,441 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-12-03 19:20:00,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:20:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-12-03 19:20:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 19:20:00,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:20:00,444 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:20:00,445 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:20:00,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:20:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-12-03 19:20:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:20:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:20:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:00,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:20:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:20:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 19:20:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:20:00,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:20:00,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:20:00,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:20:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:20:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:20:00,565 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-12-03 19:20:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:20:00,680 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-12-03 19:20:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:20:00,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-03 19:20:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:20:00,683 INFO L225 Difference]: With dead ends: 240 [2018-12-03 19:20:00,684 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 19:20:00,685 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 19:20:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 19:20:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 19:20:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 19:20:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-12-03 19:20:00,703 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-12-03 19:20:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:20:00,704 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-12-03 19:20:00,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:20:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-12-03 19:20:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 19:20:00,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:20:00,706 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:20:00,707 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:20:00,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:20:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-12-03 19:20:00,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:20:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:00,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:20:00,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:00,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:20:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:20:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 19:20:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:20:00,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:20:00,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:20:00,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:20:00,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:20:00,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:20:00,810 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-12-03 19:20:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:20:01,039 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-12-03 19:20:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:20:01,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-03 19:20:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:20:01,041 INFO L225 Difference]: With dead ends: 297 [2018-12-03 19:20:01,042 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 19:20:01,042 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 19:20:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 19:20:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 19:20:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 19:20:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-12-03 19:20:01,065 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-12-03 19:20:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:20:01,065 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-12-03 19:20:01,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:20:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-12-03 19:20:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 19:20:01,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:20:01,070 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:20:01,071 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:20:01,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:20:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-12-03 19:20:01,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:20:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:20:01,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:01,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:20:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:20:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-12-03 19:20:01,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:20:01,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:20:01,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:20:01,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:20:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:20:01,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:20:01,179 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-12-03 19:20:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:20:01,687 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-12-03 19:20:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:20:01,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-03 19:20:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:20:01,690 INFO L225 Difference]: With dead ends: 360 [2018-12-03 19:20:01,690 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 19:20:01,691 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 19:20:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 19:20:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 19:20:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 19:20:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-12-03 19:20:01,722 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-12-03 19:20:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:20:01,722 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-12-03 19:20:01,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:20:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-12-03 19:20:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 19:20:01,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:20:01,724 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:20:01,728 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:20:01,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:20:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-12-03 19:20:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:20:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:01,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:20:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:01,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:20:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:20:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 19:20:01,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:20:01,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:20:01,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:20:01,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:20:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:20:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:20:01,867 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-12-03 19:20:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:20:02,475 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-12-03 19:20:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:20:02,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-03 19:20:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:20:02,477 INFO L225 Difference]: With dead ends: 429 [2018-12-03 19:20:02,477 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 19:20:02,478 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 19:20:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 19:20:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-12-03 19:20:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-03 19:20:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-12-03 19:20:02,502 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-12-03 19:20:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:20:02,504 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-12-03 19:20:02,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:20:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-12-03 19:20:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 19:20:02,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:20:02,506 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:20:02,506 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:20:02,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:20:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-12-03 19:20:02,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:20:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:02,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:20:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:20:02,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:20:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:20:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 19:20:02,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:20:02,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:20:02,726 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2018-12-03 19:20:02,738 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [36], [40], [42], [46], [48], [52], [54], [58], [60], [62], [67], [69], [73], [75], [79], [81] [2018-12-03 19:20:02,838 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:20:02,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:20:04,186 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:20:07,578 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.Boogie2SmtSymbolTableTmpVars.getBoogieVar(Boogie2SmtSymbolTableTmpVars.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.ExpressionTransformer.toAffineExpr(ExpressionTransformer.java:167) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.ExpressionTransformer.affineExprCached(ExpressionTransformer.java:99) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processNumericAssignWithoutIfs(OctStatementProcessor.java:200) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processNumericAssign(OctStatementProcessor.java:192) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processSingleAssignment(OctStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processAssignmentStatement(OctStatementProcessor.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processStatement(OctStatementProcessor.java:65) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctPostOperator.apply(OctPostOperator.java:202) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctPostOperator.apply(OctPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainToolkit.handleStatementBySubdomain(ArrayDomainToolkit.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processSingleAssignment(ArrayDomainStatementProcessor.java:136) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processAssignment(ArrayDomainStatementProcessor.java:76) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.process(ArrayDomainStatementProcessor.java:43) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.handleInternalTransition(ArrayDomainPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:70) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 19:20:07,587 INFO L168 Benchmark]: Toolchain (without parser) took 10958.93 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -425.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 19:20:07,589 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:20:07,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.72 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 19:20:07,592 INFO L168 Benchmark]: Boogie Preprocessor took 66.65 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 19:20:07,593 INFO L168 Benchmark]: RCFGBuilder took 712.27 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 19:20:07,594 INFO L168 Benchmark]: TraceAbstraction took 10116.28 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -456.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 19:20:07,600 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.72 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 66.65 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 712.27 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10116.28 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -456.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...