java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:29,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:29,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:29,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:29,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:29,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:29,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:29,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:29,345 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:29,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:29,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:29,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:29,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:29,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:29,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:29,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:29,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:29,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:29,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:29,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:29,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:29,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:29,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:29,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:29,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:29,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:29,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:29,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:29,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:29,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:29,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:29,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:29,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:29,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:29,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:29,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:29,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:10:29,408 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:29,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:29,410 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:29,410 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:29,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:29,410 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:29,410 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:29,411 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:29,411 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:29,411 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:29,411 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:29,411 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:29,411 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:29,412 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:29,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:29,413 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:29,413 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:29,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:29,414 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:29,415 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:29,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:29,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:29,416 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:29,416 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:29,416 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:29,416 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:29,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:29,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:29,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:29,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:29,417 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:29,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:29,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:29,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:29,418 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:29,418 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:29,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:29,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:29,419 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:29,419 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:29,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:29,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:29,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:29,485 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:29,485 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:29,486 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-02-25 15:10:29,486 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-02-25 15:10:29,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:29,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:29,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:29,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:29,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:29,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,547 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-25 15:10:29,547 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-25 15:10:29,547 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-25 15:10:29,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:29,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:29,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:29,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:29,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:29,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:29,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:29,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:29,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:29,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (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 [2019-02-25 15:10:29,648 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-25 15:10:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-25 15:10:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-25 15:10:29,844 INFO L278 CfgBuilder]: Using library mode [2019-02-25 15:10:29,844 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-25 15:10:29,845 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:29 BoogieIcfgContainer [2019-02-25 15:10:29,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:29,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:29,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:29,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:29,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/2) ... [2019-02-25 15:10:29,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc2e0a and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:29, skipping insertion in model container [2019-02-25 15:10:29,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:29" (2/2) ... [2019-02-25 15:10:29,853 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-02-25 15:10:29,863 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:29,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:29,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:29,920 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:29,920 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:29,920 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:29,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:29,921 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:29,921 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:29,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:29,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-25 15:10:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:10:29,943 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:29,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:10:29,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-25 15:10:29,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:30,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:10:30,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:30,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:30,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:30,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:30,112 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-25 15:10:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:30,164 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-25 15:10:30,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:30,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:10:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:30,178 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:10:30,178 INFO L226 Difference]: Without dead ends: 5 [2019-02-25 15:10:30,181 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 [2019-02-25 15:10:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-25 15:10:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-25 15:10:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-25 15:10:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-25 15:10:30,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-25 15:10:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:30,215 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-25 15:10:30,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-25 15:10:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:10:30,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:30,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:10:30,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-02-25 15:10:30,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:30,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:30,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:10:30,556 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-02-25 15:10:30,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:30,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:30,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:30,707 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:10:30,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:30,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:30,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:30,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:10:30,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:30,975 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:30,976 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:31,046 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:31,047 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:31,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:31,327 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-25 15:10:31,328 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:31,350 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:31,384 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:31,385 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-25 15:10:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:31,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:31,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-25 15:10:31,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:31,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:10:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:10:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:10:31,483 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-02-25 15:10:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:31,699 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-25 15:10:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:31,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-25 15:10:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:31,700 INFO L225 Difference]: With dead ends: 8 [2019-02-25 15:10:31,700 INFO L226 Difference]: Without dead ends: 6 [2019-02-25 15:10:31,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-25 15:10:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-25 15:10:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:10:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-25 15:10:31,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-25 15:10:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:31,704 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-25 15:10:31,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:10:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-25 15:10:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:10:31,705 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:31,705 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:10:31,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-02-25 15:10:31,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:31,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:31,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:31,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:31,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:32,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:32,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:32,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:32,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:32,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:10:32,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:32,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:10:32,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:32,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:32,047 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:32,142 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:32,142 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:32,211 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:10:32,213 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:32,237 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:32,238 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-25 15:10:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:32,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:32,459 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-25 15:10:32,460 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:32,464 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:32,471 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:32,472 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-25 15:10:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:32,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:32,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-02-25 15:10:32,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:32,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:10:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:10:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:10:32,504 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-02-25 15:10:32,644 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2019-02-25 15:10:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:32,919 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-25 15:10:32,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:32,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:10:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:32,920 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:10:32,920 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:10:32,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:10:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:10:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:10:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:10:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-25 15:10:32,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-25 15:10:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:32,926 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-25 15:10:32,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:10:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-25 15:10:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:10:32,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:32,927 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-25 15:10:32,927 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:32,928 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-02-25 15:10:32,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:32,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:32,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,209 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-02-25 15:10:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:33,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:33,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:33,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:33,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:33,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:33,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:33,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:33,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:33,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:10:33,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:33,310 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:33,311 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:33,325 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:33,326 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:33,347 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:10:33,348 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:33,359 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:33,359 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-25 15:10:33,400 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-25 15:10:33,401 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:33,418 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:33,419 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-25 15:10:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:33,479 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:33,650 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-25 15:10:33,650 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:33,652 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:33,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:33,660 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-25 15:10:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:10:33,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:33,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-02-25 15:10:33,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:33,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:10:33,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:10:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:10:33,688 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-02-25 15:10:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:33,896 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-25 15:10:33,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:33,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:10:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:33,897 INFO L225 Difference]: With dead ends: 10 [2019-02-25 15:10:33,897 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:10:33,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:10:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:10:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-25 15:10:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:10:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-25 15:10:33,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-25 15:10:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:33,902 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-25 15:10:33,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:10:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-25 15:10:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:10:33,903 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:33,903 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-25 15:10:33,903 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-02-25 15:10:33,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,244 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-02-25 15:10:34,376 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-02-25 15:10:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:34,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:34,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:34,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:34,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:34,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,464 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:10:34,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:34,485 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:34,486 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:34,521 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:34,521 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:34,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:10:34,540 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:34,551 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:34,552 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-25 15:10:34,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-25 15:10:34,586 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:34,618 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:34,619 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-25 15:10:34,667 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-25 15:10:34,668 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:34,690 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:34,691 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-25 15:10:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:34,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:35,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-25 15:10:35,011 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:35,013 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:35,018 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:35,018 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-25 15:10:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 15:10:35,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:35,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-02-25 15:10:35,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:35,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:10:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:10:35,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:10:35,045 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-02-25 15:10:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:35,304 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-25 15:10:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:35,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-25 15:10:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:35,305 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:10:35,305 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:10:35,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:10:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:10:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:10:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-25 15:10:35,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-25 15:10:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:35,309 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-25 15:10:35,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:10:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-25 15:10:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:10:35,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:35,310 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-25 15:10:35,310 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-02-25 15:10:35,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,737 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-02-25 15:10:35,950 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-02-25 15:10:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:35,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:35,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:35,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:36,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:36,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:36,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:10:36,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:36,016 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:36,038 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,048 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:36,049 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:36,093 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:10:36,094 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,112 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:36,112 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-25 15:10:36,147 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-25 15:10:36,147 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,174 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:36,175 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-25 15:10:36,280 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-25 15:10:36,281 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,311 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:36,311 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-25 15:10:36,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-25 15:10:36,393 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,627 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:36,628 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-25 15:10:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,872 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:38,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-25 15:10:38,611 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,633 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,659 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-25 15:10:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-25 15:10:38,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:38,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-02-25 15:10:38,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:38,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:10:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:10:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:10:38,689 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-02-25 15:10:39,268 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-02-25 15:10:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:39,284 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-25 15:10:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:10:39,291 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-02-25 15:10:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:39,292 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:10:39,292 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:10:39,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:10:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:10:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-25 15:10:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:10:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-25 15:10:39,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-25 15:10:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:39,296 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-25 15:10:39,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:10:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-25 15:10:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:10:39,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:39,297 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-25 15:10:39,297 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-02-25 15:10:39,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,806 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-02-25 15:10:40,022 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-02-25 15:10:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:40,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:40,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:40,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:40,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:40,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:40,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:40,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:40,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:40,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:10:40,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:40,075 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:40,075 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,089 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:40,089 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:40,113 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:10:40,114 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,123 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:40,124 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-25 15:10:40,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-25 15:10:40,152 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,168 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:40,168 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-25 15:10:40,224 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-25 15:10:40,224 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,245 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:40,245 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-25 15:10:40,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-25 15:10:40,318 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,342 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:40,343 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-25 15:10:40,555 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-25 15:10:40,555 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,592 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:40,593 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-25 15:10:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:46,657 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-25 15:10:46,658 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:46,659 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:46,664 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:46,665 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-25 15:10:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-25 15:10:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:46,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-02-25 15:10:46,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:46,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:10:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:10:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:10:46,696 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-02-25 15:10:47,070 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2019-02-25 15:10:51,703 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-02-25 15:10:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:51,718 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-25 15:10:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:51,719 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-02-25 15:10:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:51,720 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:10:51,720 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:10:51,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-02-25 15:10:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:10:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:10:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:10:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-25 15:10:51,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-25 15:10:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:51,726 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-25 15:10:51,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:10:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-25 15:10:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:10:51,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:51,727 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-25 15:10:51,727 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-02-25 15:10:51,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,227 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-02-25 15:10:52,397 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-02-25 15:10:52,645 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-02-25 15:10:52,920 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-02-25 15:10:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:52,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:52,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:52,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:52,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:10:52,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:52,996 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:10:52,996 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:53,001 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:53,002 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-25 15:10:53,024 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:10:53,024 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:53,033 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:53,033 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-25 15:10:53,084 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-25 15:10:53,085 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:53,100 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:53,100 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-25 15:10:53,291 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-25 15:10:53,292 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:53,313 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:53,314 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-25 15:10:53,384 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-25 15:10:53,385 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:53,410 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:53,410 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-25 15:10:53,731 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-25 15:10:53,732 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:53,763 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:53,763 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-25 15:10:55,902 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-02-25 15:10:55,903 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:55,957 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-25 15:10:55,957 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-02-25 15:11:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:09,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:21,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-25 15:11:21,950 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:21,959 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:21,971 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:21,971 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-25 15:11:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-25 15:11:22,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:22,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-02-25 15:11:22,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:22,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:11:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:11:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=309, Unknown=3, NotChecked=0, Total=420 [2019-02-25 15:11:22,032 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-02-25 15:11:37,330 WARN L181 SmtUtils]: Spent 8.72 s on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2019-02-25 15:11:50,739 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-02-25 15:12:06,358 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:12:06,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:12:06,359 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-02-25 15:12:06,366 INFO L168 Benchmark]: Toolchain (without parser) took 96853.07 ms. Allocated memory was 140.5 MB in the beginning and 329.3 MB in the end (delta: 188.7 MB). Free memory was 105.7 MB in the beginning and 234.4 MB in the end (delta: -128.8 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:06,367 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 140.5 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:12:06,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.52 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 103.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:06,368 INFO L168 Benchmark]: Boogie Preprocessor took 21.79 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 102.8 MB in the end (delta: 969.4 kB). Peak memory consumption was 969.4 kB. Max. memory is 7.1 GB. [2019-02-25 15:12:06,368 INFO L168 Benchmark]: RCFGBuilder took 273.43 ms. Allocated memory is still 140.5 MB. Free memory was 102.5 MB in the beginning and 94.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:06,369 INFO L168 Benchmark]: TraceAbstraction took 96518.62 ms. Allocated memory was 140.5 MB in the beginning and 329.3 MB in the end (delta: 188.7 MB). Free memory was 93.5 MB in the beginning and 234.4 MB in the end (delta: -140.9 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:12:06,372 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.13 ms. Allocated memory is still 140.5 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.52 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 103.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.79 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 102.8 MB in the end (delta: 969.4 kB). Peak memory consumption was 969.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 273.43 ms. Allocated memory is still 140.5 MB. Free memory was 102.5 MB in the beginning and 94.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96518.62 ms. Allocated memory was 140.5 MB in the beginning and 329.3 MB in the end (delta: 188.7 MB). Free memory was 93.5 MB in the beginning and 234.4 MB in the end (delta: -140.9 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...