java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:00:02,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:00:02,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:00:02,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:00:02,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:00:02,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:00:02,040 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:00:02,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:00:02,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:00:02,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:00:02,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:00:02,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:00:02,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:00:02,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:00:02,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:00:02,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:00:02,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:00:02,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:00:02,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:00:02,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:00:02,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:00:02,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:00:02,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:00:02,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:00:02,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:00:02,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:00:02,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:00:02,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:00:02,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:00:02,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:00:02,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:00:02,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:00:02,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:00:02,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:00:02,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:00:02,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:00:02,084 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 18:00:02,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:00:02,107 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:00:02,108 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:00:02,108 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:00:02,108 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:00:02,108 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:00:02,108 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:00:02,109 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:00:02,109 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:00:02,109 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:00:02,109 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:00:02,109 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:00:02,110 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:00:02,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:00:02,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:00:02,111 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:00:02,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:00:02,113 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:00:02,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:00:02,114 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:00:02,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:00:02,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:00:02,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:00:02,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:00:02,115 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:00:02,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:00:02,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:00:02,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:00:02,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:00:02,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:00:02,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:00:02,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:00:02,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:00:02,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:00:02,117 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:00:02,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:00:02,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:00:02,117 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:00:02,118 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:00:02,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:00:02,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:00:02,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:00:02,195 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:00:02,196 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:00:02,197 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 18:00:02,197 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 18:00:02,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:00:02,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:00:02,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:00:02,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:00:02,312 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:00:02,330 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,349 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:00:02,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:00:02,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:00:02,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:00:02,374 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,375 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,380 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,388 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,399 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,402 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,405 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 06:00:02" (1/1) ... [2018-12-03 18:00:02,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:00:02,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:00:02,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:00:02,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:00:02,416 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 06:00:02" (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 18:00:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:00:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:00:03,010 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:00:03,011 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:00:03,011 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 06:00:03 BoogieIcfgContainer [2018-12-03 18:00:03,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:00:03,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:00:03,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:00:03,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:00:03,016 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 06:00:02" (1/2) ... [2018-12-03 18:00:03,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1378f73d and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:00:03, skipping insertion in model container [2018-12-03 18:00:03,017 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 06:00:03" (2/2) ... [2018-12-03 18:00:03,019 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-12-03 18:00:03,029 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:00:03,037 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:00:03,054 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:00:03,093 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:00:03,093 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:00:03,093 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:00:03,093 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:00:03,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:00:03,094 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:00:03,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:00:03,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:00:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 18:00:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:00:03,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:03,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:03,118 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:03,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-12-03 18:00:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:03,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:03,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:03,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:03,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:03,357 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 18:00:03,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:03,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:03,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:03,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:03,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:03,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:03,379 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 18:00:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:03,598 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-12-03 18:00:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:03,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 18:00:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:03,612 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:00:03,613 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:00:03,617 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 18:00:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:00:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:00:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:00:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-12-03 18:00:03,658 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-12-03 18:00:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:03,658 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-03 18:00:03,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-12-03 18:00:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:00:03,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:03,659 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:03,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:03,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:03,660 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-12-03 18:00:03,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:03,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:03,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:03,771 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 18:00:03,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:03,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:03,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:03,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:03,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:03,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:03,775 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-12-03 18:00:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:03,999 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-12-03 18:00:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:04,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 18:00:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:04,003 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:00:04,003 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:00:04,008 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 18:00:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:00:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:00:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:00:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-12-03 18:00:04,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-12-03 18:00:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:04,022 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-12-03 18:00:04,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-12-03 18:00:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:00:04,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:04,024 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:04,024 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:04,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-12-03 18:00:04,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:04,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:04,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:04,160 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 18:00:04,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:04,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:04,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:04,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:04,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:04,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:04,162 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-12-03 18:00:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:04,336 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-12-03 18:00:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:04,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 18:00:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:04,338 INFO L225 Difference]: With dead ends: 50 [2018-12-03 18:00:04,339 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:00:04,339 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 18:00:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:00:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:00:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:00:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-12-03 18:00:04,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-12-03 18:00:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:04,348 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-12-03 18:00:04,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-12-03 18:00:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:00:04,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:04,350 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:04,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:04,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-12-03 18:00:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:04,465 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 18:00:04,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:04,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:04,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:04,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:04,471 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-12-03 18:00:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:04,517 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-12-03 18:00:04,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:04,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 18:00:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:04,520 INFO L225 Difference]: With dead ends: 74 [2018-12-03 18:00:04,520 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 18:00:04,523 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 18:00:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 18:00:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-03 18:00:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:00:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-12-03 18:00:04,537 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-12-03 18:00:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:04,538 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-12-03 18:00:04,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-12-03 18:00:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:00:04,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:04,540 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 18:00:04,540 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:04,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:04,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-12-03 18:00:04,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:04,678 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 18:00:04,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:04,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:04,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:04,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:04,681 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-12-03 18:00:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:04,857 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-12-03 18:00:04,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:04,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 18:00:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:04,863 INFO L225 Difference]: With dead ends: 92 [2018-12-03 18:00:04,863 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:00:04,864 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 18:00:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:00:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:00:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:00:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-12-03 18:00:04,874 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-12-03 18:00:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:04,875 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-12-03 18:00:04,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-12-03 18:00:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:00:04,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:04,877 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 18:00:04,877 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:04,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:04,877 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-12-03 18:00:04,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:04,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:04,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:04,981 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 18:00:04,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:04,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:04,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:04,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:04,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:04,985 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-12-03 18:00:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:05,163 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-12-03 18:00:05,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:05,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 18:00:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:05,169 INFO L225 Difference]: With dead ends: 71 [2018-12-03 18:00:05,170 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:00:05,170 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 18:00:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:00:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-12-03 18:00:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:00:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-12-03 18:00:05,183 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-12-03 18:00:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:05,183 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-12-03 18:00:05,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-12-03 18:00:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:00:05,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:05,185 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 18:00:05,186 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:05,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-12-03 18:00:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:05,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:05,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:05,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:05,290 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 18:00:05,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:05,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:05,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:05,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:05,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:05,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:05,293 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-12-03 18:00:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:05,521 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-12-03 18:00:05,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:05,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 18:00:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:05,526 INFO L225 Difference]: With dead ends: 161 [2018-12-03 18:00:05,527 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 18:00:05,527 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 18:00:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 18:00:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 18:00:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:00:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-12-03 18:00:05,544 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-12-03 18:00:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:05,544 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-12-03 18:00:05,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-12-03 18:00:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 18:00:05,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:05,547 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 18:00:05,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:05,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-12-03 18:00:05,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:05,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:05,670 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 18:00:05,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:05,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:05,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:05,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:05,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:05,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:05,672 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-12-03 18:00:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:06,053 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-12-03 18:00:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:06,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 18:00:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:06,058 INFO L225 Difference]: With dead ends: 205 [2018-12-03 18:00:06,058 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 18:00:06,062 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 18:00:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 18:00:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 18:00:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 18:00:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-12-03 18:00:06,093 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-12-03 18:00:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:06,094 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-12-03 18:00:06,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-12-03 18:00:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:00:06,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:06,098 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 18:00:06,098 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:06,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-12-03 18:00:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:06,203 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 18:00:06,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:06,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:06,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:06,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:06,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:06,205 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-12-03 18:00:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:06,349 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-12-03 18:00:06,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:06,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-03 18:00:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:06,351 INFO L225 Difference]: With dead ends: 240 [2018-12-03 18:00:06,351 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 18:00:06,352 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 18:00:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 18:00:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 18:00:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 18:00:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-12-03 18:00:06,379 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-12-03 18:00:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:06,380 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-12-03 18:00:06,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-12-03 18:00:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 18:00:06,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:06,382 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 18:00:06,382 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:06,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-12-03 18:00:06,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:06,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:06,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:06,460 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 18:00:06,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:06,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:06,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:06,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:06,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:06,462 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-12-03 18:00:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:06,721 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-12-03 18:00:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:06,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-03 18:00:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:06,724 INFO L225 Difference]: With dead ends: 297 [2018-12-03 18:00:06,724 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 18:00:06,726 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 18:00:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 18:00:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 18:00:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 18:00:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-12-03 18:00:06,747 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-12-03 18:00:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:06,748 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-12-03 18:00:06,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-12-03 18:00:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 18:00:06,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:06,750 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 18:00:06,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:06,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-12-03 18:00:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:06,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:06,866 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 18:00:06,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:06,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:06,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:06,868 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-12-03 18:00:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:07,230 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-12-03 18:00:07,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:07,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-03 18:00:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:07,235 INFO L225 Difference]: With dead ends: 360 [2018-12-03 18:00:07,235 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 18:00:07,236 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 18:00:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 18:00:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 18:00:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 18:00:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-12-03 18:00:07,255 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-12-03 18:00:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:07,255 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-12-03 18:00:07,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-12-03 18:00:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 18:00:07,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:07,257 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 18:00:07,257 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:07,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-12-03 18:00:07,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:07,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:07,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:07,379 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 18:00:07,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:07,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:07,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:07,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:07,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:07,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:07,381 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-12-03 18:00:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:07,933 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-12-03 18:00:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:07,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-03 18:00:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:07,938 INFO L225 Difference]: With dead ends: 429 [2018-12-03 18:00:07,938 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 18:00:07,939 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 18:00:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 18:00:07,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-12-03 18:00:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-03 18:00:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-12-03 18:00:07,959 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-12-03 18:00:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:07,960 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-12-03 18:00:07,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-12-03 18:00:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 18:00:07,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:07,963 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 18:00:07,963 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:07,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-12-03 18:00:07,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:07,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:07,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:08,157 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 18:00:08,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:08,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:00:08,159 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2018-12-03 18:00:08,161 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 18:00:08,229 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:00:08,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:00:09,731 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:00:13,384 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.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:581) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.visit(NonrelationalStatementProcessor.java:520) at de.uni_freiburg.informatik.ultimate.boogie.BoogieVisitor.processExpression(BoogieVisitor.java:369) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processExpression(NonrelationalStatementProcessor.java:221) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleSingleAssignment(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssignment(NonrelationalStatementProcessor.java:294) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:191) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:176) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:145) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:364) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:127) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.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.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 18:00:13,389 INFO L168 Benchmark]: Toolchain (without parser) took 11079.49 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -106.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-12-03 18:00:13,391 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 18:00:13,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.92 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 18:00:13,392 INFO L168 Benchmark]: Boogie Preprocessor took 52.89 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 18:00:13,392 INFO L168 Benchmark]: RCFGBuilder took 596.85 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 18:00:13,393 INFO L168 Benchmark]: TraceAbstraction took 10375.52 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -137.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-12-03 18:00:13,398 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 49.92 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 52.89 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 596.85 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 10375.52 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -137.8 MB). Peak memory consumption was 1.4 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...