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/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:28:10,472 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:28:10,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:28:10,492 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:28:10,492 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:28:10,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:28:10,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:28:10,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:28:10,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:28:10,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:28:10,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:28:10,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:28:10,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:28:10,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:28:10,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:28:10,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:28:10,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:28:10,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:28:10,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:28:10,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:28:10,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:28:10,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:28:10,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:28:10,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:28:10,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:28:10,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:28:10,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:28:10,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:28:10,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:28:10,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:28:10,542 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:28:10,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:28:10,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:28:10,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:28:10,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:28:10,546 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:28:10,547 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:28:10,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:28:10,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:28:10,569 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:28:10,570 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:28:10,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:28:10,573 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:28:10,573 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:28:10,573 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:28:10,573 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:28:10,574 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:28:10,574 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:28:10,574 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:28:10,574 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:28:10,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:28:10,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:28:10,576 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:28:10,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:28:10,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:28:10,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:28:10,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:28:10,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:28:10,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:28:10,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:28:10,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:28:10,578 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:28:10,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:28:10,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:28:10,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:28:10,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:28:10,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:28:10,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:28:10,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:28:10,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:28:10,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:28:10,581 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:28:10,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:28:10,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:28:10,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:28:10,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:28:10,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:28:10,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:28:10,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:28:10,659 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:28:10,660 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:28:10,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 17:28:10,661 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl' [2018-12-03 17:28:10,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:28:10,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:28:10,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:10,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:28:10,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:28:10,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:10,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:28:10,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:28:10,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:28:10,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/1) ... [2018-12-03 17:28:10,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:28:10,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:28:10,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:28:10,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:28:10,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (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:28:10,924 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:28:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:28:10,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:28:11,527 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:28:11,527 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:28:11,528 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:11 BoogieIcfgContainer [2018-12-03 17:28:11,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:28:11,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:28:11,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:28:11,532 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:28:11,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:10" (1/2) ... [2018-12-03 17:28:11,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c856bab and model type pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:11, skipping insertion in model container [2018-12-03 17:28:11,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:11" (2/2) ... [2018-12-03 17:28:11,536 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 17:28:11,546 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:28:11,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:28:11,572 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:28:11,608 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:28:11,608 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:28:11,608 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:28:11,608 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:28:11,609 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:28:11,609 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:28:11,609 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:28:11,609 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:28:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 17:28:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:11,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:11,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:11,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:11,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 17:28:11,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:11,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:11,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,869 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:28:11,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:11,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:11,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:11,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:11,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:11,893 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 17:28:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:11,957 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2018-12-03 17:28:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:11,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:11,969 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:28:11,970 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:28:11,974 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:28:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:28:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:28:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:28:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-03 17:28:12,011 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 16 [2018-12-03 17:28:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:12,012 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-03 17:28:12,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-12-03 17:28:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:12,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:12,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:12,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:12,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-12-03 17:28:12,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:12,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,133 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:28:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:12,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:12,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:12,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:12,138 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-12-03 17:28:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:12,163 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-12-03 17:28:12,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:12,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:12,166 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:28:12,166 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:28:12,169 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:28:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:28:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:28:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:28:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-03 17:28:12,179 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2018-12-03 17:28:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:12,179 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-03 17:28:12,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-12-03 17:28:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:12,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:12,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:12,181 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:12,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1686901289, now seen corresponding path program 1 times [2018-12-03 17:28:12,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:12,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:12,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,333 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:28:12,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:12,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:12,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:12,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:12,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:12,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:12,335 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2018-12-03 17:28:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:12,398 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-12-03 17:28:12,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:12,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:12,400 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:28:12,400 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:28:12,401 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:28:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:28:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:28:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:28:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-03 17:28:12,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 16 [2018-12-03 17:28:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:12,418 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-03 17:28:12,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-12-03 17:28:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:12,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:12,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:12,421 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:12,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2079928299, now seen corresponding path program 1 times [2018-12-03 17:28:12,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,537 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:28:12,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:12,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:12,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:12,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:12,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:12,540 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 3 states. [2018-12-03 17:28:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:12,584 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-12-03 17:28:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:12,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:12,585 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:28:12,585 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:28:12,586 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:28:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:28:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:28:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:28:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-03 17:28:12,596 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-12-03 17:28:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:12,596 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-03 17:28:12,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-12-03 17:28:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:12,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:12,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:12,598 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:12,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1270581673, now seen corresponding path program 1 times [2018-12-03 17:28:12,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:12,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,710 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:28:12,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:12,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:12,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:12,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:12,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:12,712 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 3 states. [2018-12-03 17:28:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:12,738 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-12-03 17:28:12,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:12,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:28:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:12,742 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:28:12,743 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:28:12,743 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:28:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:28:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-03 17:28:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:28:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-12-03 17:28:12,762 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2018-12-03 17:28:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:12,763 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-12-03 17:28:12,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2018-12-03 17:28:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:12,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:12,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:12,764 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:12,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1213323371, now seen corresponding path program 1 times [2018-12-03 17:28:12,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:12,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:12,870 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:28:12,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:12,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:12,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:12,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:12,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:12,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:12,873 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 4 states. [2018-12-03 17:28:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:12,988 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-12-03 17:28:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:12,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:28:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:12,992 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:28:12,992 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:28:12,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:28:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:28:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-12-03 17:28:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:28:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-03 17:28:13,013 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 16 [2018-12-03 17:28:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:13,015 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-03 17:28:13,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-03 17:28:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:28:13,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:13,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:13,019 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:13,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:13,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1213382953, now seen corresponding path program 1 times [2018-12-03 17:28:13,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:13,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:13,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:13,138 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:28:13,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:13,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:13,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:13,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:13,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:13,141 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 4 states. [2018-12-03 17:28:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:13,262 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-12-03 17:28:13,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:13,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:28:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:13,266 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:28:13,266 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:28:13,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:28:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:28:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-03 17:28:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:28:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-12-03 17:28:13,279 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 16 [2018-12-03 17:28:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:13,279 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-03 17:28:13,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-12-03 17:28:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:28:13,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:13,281 INFO L402 BasicCegarLoop]: trace histogram [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:28:13,281 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:13,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:13,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1468461941, now seen corresponding path program 1 times [2018-12-03 17:28:13,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:13,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:13,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:13,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:13,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:13,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:13,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:13,571 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 17:28:13,573 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] [2018-12-03 17:28:13,630 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:28:13,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:28:14,766 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:28:19,611 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) 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) Caused by: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctDomainState.numVarIndex(OctDomainState.java:1167) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctDomainState.assumeNumericVarInterval(OctDomainState.java:1086) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.lambda$18(OctAssumeProcessor.java:643) at java.util.ArrayList.forEach(ArrayList.java:1257) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processAffineLtZero(OctAssumeProcessor.java:643) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processNumericRelationWithoutIfs(OctAssumeProcessor.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processNumericRelation(OctAssumeProcessor.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processBooleanOperations(OctAssumeProcessor.java:168) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.assumeAnd(OctAssumeProcessor.java:215) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.processBooleanOperations(OctAssumeProcessor.java:149) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctAssumeProcessor.assume(OctAssumeProcessor.java:98) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processStatement(OctStatementProcessor.java:68) 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.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.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.ArrayDomainToolkit.handleAssumptionBySubdomain(ArrayDomainToolkit.java:148) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainExpressionProcessor.processAssume(ArrayDomainExpressionProcessor.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processAssume(ArrayDomainStatementProcessor.java:62) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.process(ArrayDomainStatementProcessor.java:45) 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) ... 20 more [2018-12-03 17:28:19,615 INFO L168 Benchmark]: Toolchain (without parser) took 8879.26 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -960.3 MB). Peak memory consumption was 561.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:28:19,617 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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:28:19,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.81 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:28:19,619 INFO L168 Benchmark]: Boogie Preprocessor took 58.14 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:28:19,619 INFO L168 Benchmark]: RCFGBuilder took 688.71 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 17:28:19,620 INFO L168 Benchmark]: TraceAbstraction took 8085.14 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -992.0 MB). Peak memory consumption was 530.0 MB. Max. memory is 7.1 GB. [2018-12-03 17:28:19,625 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.25 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 42.81 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 58.14 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 688.71 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 8085.14 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -992.0 MB). Peak memory consumption was 530.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...