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/heapseparator/speedup-poc-dd-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:01:45,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:01:45,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:01:45,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:01:45,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:01:45,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:01:45,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:01:45,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:01:45,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:01:45,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:01:45,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:01:45,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:01:45,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:01:45,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:01:45,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:01:45,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:01:45,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:01:45,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:01:45,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:01:45,883 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:01:45,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:01:45,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:01:45,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:01:45,888 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:01:45,888 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:01:45,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:01:45,890 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:01:45,891 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:01:45,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:01:45,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:01:45,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:01:45,894 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:01:45,894 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:01:45,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:01:45,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:01:45,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:01:45,896 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-01-20 10:01:45,909 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:01:45,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:01:45,910 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:01:45,910 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:01:45,911 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:01:45,911 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:01:45,911 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:01:45,911 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:01:45,911 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:01:45,912 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:01:45,912 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:01:45,912 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:01:45,912 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:01:45,912 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:01:45,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:01:45,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:01:45,913 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:01:45,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:01:45,914 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:01:45,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:01:45,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:01:45,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:01:45,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:01:45,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:01:45,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:01:45,915 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:01:45,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:01:45,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:01:45,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:01:45,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:01:45,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:01:45,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:01:45,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:01:45,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:01:45,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:01:45,917 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:01:45,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:01:45,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:01:45,918 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:01:45,918 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:01:45,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:01:45,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:01:45,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:01:45,969 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:01:45,970 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:01:45,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-01-20 10:01:45,971 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-20 10:01:46,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:01:46,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:01:46,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:01:46,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:01:46,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:01:46,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:01:46,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:01:46,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:01:46,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:01:46,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/1) ... [2019-01-20 10:01:46,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:01:46,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:01:46,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:01:46,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:01:46,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (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-01-20 10:01:46,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:01:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:01:46,514 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:01:46,514 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-20 10:01:46,515 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:01:46 BoogieIcfgContainer [2019-01-20 10:01:46,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:01:46,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:01:46,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:01:46,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:01:46,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:01:46" (1/2) ... [2019-01-20 10:01:46,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfc208d and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:01:46, skipping insertion in model container [2019-01-20 10:01:46,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:01:46" (2/2) ... [2019-01-20 10:01:46,526 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-20 10:01:46,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:01:46,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-20 10:01:46,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-20 10:01:46,601 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:01:46,601 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:01:46,601 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:01:46,601 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:01:46,601 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:01:46,601 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:01:46,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:01:46,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:01:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-20 10:01:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:01:46,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:46,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:01:46,635 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:46,644 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-20 10:01:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:46,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:46,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:46,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:01:46,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:01:46,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:01:46,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:01:46,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:01:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:01:46,847 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-20 10:01:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:47,026 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-20 10:01:47,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:01:47,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:01:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:47,042 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:01:47,042 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:01:47,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-20 10:01:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:01:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-20 10:01:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 10:01:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-20 10:01:47,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-20 10:01:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:47,080 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-20 10:01:47,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:01:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-20 10:01:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:01:47,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:47,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:01:47,082 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-20 10:01:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:47,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:47,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:47,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:01:47,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:01:47,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:01:47,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:01:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:01:47,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:01:47,127 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-20 10:01:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:47,209 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-20 10:01:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:01:47,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:01:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:47,211 INFO L225 Difference]: With dead ends: 12 [2019-01-20 10:01:47,211 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:01:47,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-20 10:01:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:01:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-20 10:01:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 10:01:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-20 10:01:47,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-20 10:01:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:47,218 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-20 10:01:47,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:01:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-20 10:01:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:01:47,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:47,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:01:47,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-20 10:01:47,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:47,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:47,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:47,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:47,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:47,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:01:47,331 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-20 10:01:47,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:47,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:47,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:47,447 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:01:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:47,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:47,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:47,454 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-01-20 10:01:47,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:47,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:47,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:47,688 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-20 10:01:47,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:47,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:47,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:47,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:47,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:47,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:47,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:47,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:48,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:01:48,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:48,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,106 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:48,157 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:48,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:48,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:01:48,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,277 INFO L267 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-01-20 10:01:48,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:48,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:48,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:01:48,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:01:48,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:01:48,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:01:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:01:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:01:48,408 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-20 10:01:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:48,505 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-20 10:01:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:01:48,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:01:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:48,507 INFO L225 Difference]: With dead ends: 13 [2019-01-20 10:01:48,507 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:01:48,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:01:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:01:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-20 10:01:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:01:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-20 10:01:48,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-20 10:01:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:48,512 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-20 10:01:48,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:01:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-20 10:01:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:01:48,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:48,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:01:48,514 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:48,515 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-20 10:01:48,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:48,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:48,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:48,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:48,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:48,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:48,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:48,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:01:48,586 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-20 10:01:48,588 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:48,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:48,593 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:48,594 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:01:48,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:48,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:48,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:48,594 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-01-20 10:01:48,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:48,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:48,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:48,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:48,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:48,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:48,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:48,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:48,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:48,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:01:48,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:48,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:48,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:48,888 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:49,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:49,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:01:49,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:49,199 INFO L267 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-01-20 10:01:49,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:49,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:49,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:49,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:01:49,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:49,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:01:49,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:01:49,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:01:49,319 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-20 10:01:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:49,555 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-20 10:01:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:01:49,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:01:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:49,557 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:01:49,558 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 10:01:49,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:01:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 10:01:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-20 10:01:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:01:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-20 10:01:49,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-20 10:01:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:49,564 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-20 10:01:49,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:01:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-20 10:01:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:01:49,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:49,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:01:49,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-20 10:01:49,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:49,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:49,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:49,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:49,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:01:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:01:49,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:01:49,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:01:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:01:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:01:49,590 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-20 10:01:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:49,628 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-20 10:01:49,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:01:49,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:01:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:49,629 INFO L225 Difference]: With dead ends: 15 [2019-01-20 10:01:49,629 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:01:49,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-20 10:01:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:01:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 10:01:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:01:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-20 10:01:49,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-20 10:01:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:49,635 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-20 10:01:49,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:01:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-20 10:01:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:01:49,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:49,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:01:49,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-20 10:01:49,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:49,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:49,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:49,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:49,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:49,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:49,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:01:49,764 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-20 10:01:49,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:49,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:49,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:49,773 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:01:49,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:49,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:49,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:49,774 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-01-20 10:01:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:49,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:49,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:49,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-20 10:01:49,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 21 [2019-01-20 10:01:49,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:49,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:49,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:49,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:49,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:49,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:49,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:49,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:49,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:49,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:49,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:49,950 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:49,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:50,024 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:50,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:01:50,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,097 INFO L267 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-01-20 10:01:50,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:50,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:50,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:50,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:01:50,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:50,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:01:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:01:50,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:01:50,171 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-20 10:01:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:50,329 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-20 10:01:50,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:01:50,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:01:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:50,330 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:01:50,331 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:01:50,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:01:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:01:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-20 10:01:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:01:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-20 10:01:50,337 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-20 10:01:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:50,337 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-20 10:01:50,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:01:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-20 10:01:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:01:50,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:50,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:01:50,338 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-20 10:01:50,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:50,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:50,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:50,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:50,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:50,401 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:01:50,401 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-20 10:01:50,402 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:50,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:50,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:50,408 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:01:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:50,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:50,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:50,408 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-01-20 10:01:50,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:50,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:50,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:50,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:50,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:50,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:50,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:01:50,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:50,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:50,589 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:01:50,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,659 INFO L267 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-01-20 10:01:50,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:50,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:50,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:01:50,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:50,751 INFO L267 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-01-20 10:01:50,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-20 10:01:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:50,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:50,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:50,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:01:50,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:50,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:01:50,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:01:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:01:50,819 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-20 10:01:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:51,046 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-20 10:01:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:01:51,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:01:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:51,047 INFO L225 Difference]: With dead ends: 35 [2019-01-20 10:01:51,047 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 10:01:51,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:01:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 10:01:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-20 10:01:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 10:01:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-20 10:01:51,054 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-20 10:01:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:51,054 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-20 10:01:51,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:01:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-20 10:01:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:01:51,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:51,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:01:51,055 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-20 10:01:51,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:51,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:51,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:51,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:51,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:51,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:01:51,098 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-20 10:01:51,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:51,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:51,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:51,105 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:01:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:51,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:51,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:51,106 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-01-20 10:01:51,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:51,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:51,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:51,126 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:51,130 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:01:51,143 INFO L478 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-01-20 10:01:51,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,176 INFO L267 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-01-20 10:01:51,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-20 10:01:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-20 10:01:51,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:01:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:51,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:01:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-20 10:01:51,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:01:51,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:01:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:01:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:01:51,239 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-20 10:01:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:51,290 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-20 10:01:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:01:51,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:01:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:51,291 INFO L225 Difference]: With dead ends: 30 [2019-01-20 10:01:51,291 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 10:01:51,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:01:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 10:01:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-20 10:01:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:01:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-20 10:01:51,300 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-20 10:01:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:51,300 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-20 10:01:51,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:01:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-20 10:01:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:01:51,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:51,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:01:51,301 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-20 10:01:51,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:51,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:51,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:51,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:51,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:51,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:51,397 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:01:51,397 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-20 10:01:51,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:51,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:51,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:51,403 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:01:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:51,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:51,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:51,404 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-01-20 10:01:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:51,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:51,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:51,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-20 10:01:51,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 21 [2019-01-20 10:01:51,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:51,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:51,556 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,561 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,574 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:51,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:01:51,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,614 INFO L267 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-01-20 10:01:51,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:51,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:51,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:01:51,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:51,659 INFO L267 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-01-20 10:01:51,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-20 10:01:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:51,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:51,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:01:51,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:51,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:01:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:01:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:01:51,731 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-20 10:01:51,972 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-20 10:01:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:52,057 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-20 10:01:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:01:52,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:01:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:52,059 INFO L225 Difference]: With dead ends: 48 [2019-01-20 10:01:52,059 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:01:52,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:01:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:01:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-20 10:01:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:01:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-20 10:01:52,070 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-20 10:01:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:52,070 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-20 10:01:52,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:01:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-20 10:01:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:01:52,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:52,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:01:52,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-20 10:01:52,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:52,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:52,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:52,211 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:01:52,211 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-20 10:01:52,213 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:52,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:52,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:52,217 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:01:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:52,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:52,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:52,217 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-01-20 10:01:52,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:52,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:52,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:52,240 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:01:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:52,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:52,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:01:52,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:52,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:52,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-20 10:01:52,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:01:52,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:01:52,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:52,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:52,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:52,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:52,309 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-20 10:01:52,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:52,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:01:52,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:52,381 INFO L267 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-01-20 10:01:52,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-20 10:01:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:52,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:52,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:52,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:01:52,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:52,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:01:52,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:01:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:01:52,624 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-20 10:01:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:52,740 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-20 10:01:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:01:52,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:01:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:52,741 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:01:52,741 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:01:52,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:01:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:01:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-20 10:01:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:01:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-20 10:01:52,750 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-20 10:01:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:52,750 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-20 10:01:52,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:01:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-20 10:01:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:01:52,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:52,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:01:52,752 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:52,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-20 10:01:52,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:52,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:52,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:52,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:52,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:52,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:01:52,840 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-20 10:01:52,842 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:52,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:52,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:52,848 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:01:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:52,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:52,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:52,849 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:52,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:52,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:52,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:52,868 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:52,914 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:01:52,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:52,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:52,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:01:52,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,045 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:01:53,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:01:53,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:53,074 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-20 10:01:53,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:01:53,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,123 INFO L267 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-01-20 10:01:53,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-20 10:01:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:53,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:53,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:01:53,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-20 10:01:53,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:01:53,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:01:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:01:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:01:53,165 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-20 10:01:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:53,300 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-20 10:01:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:01:53,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:01:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:53,301 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:01:53,302 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:01:53,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:01:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:01:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-20 10:01:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:01:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-20 10:01:53,319 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-20 10:01:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:53,319 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-20 10:01:53,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:01:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-20 10:01:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:01:53,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:53,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:01:53,320 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-20 10:01:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:53,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:53,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:01:53,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:53,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:53,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:01:53,468 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-20 10:01:53,470 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:53,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:53,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:53,476 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:01:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:53,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:53,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:53,478 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:53,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:53,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:53,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:53,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-20 10:01:53,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 21 [2019-01-20 10:01:53,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:53,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:53,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:53,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,616 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:53,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:01:53,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,659 INFO L267 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-01-20 10:01:53,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:53,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:53,677 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:01:53,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:01:53,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:53,689 INFO L267 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-01-20 10:01:53,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-20 10:01:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:53,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:53,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:53,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:01:53,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:53,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:01:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:01:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:01:53,742 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-20 10:01:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:53,982 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-20 10:01:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:01:53,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-20 10:01:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:53,984 INFO L225 Difference]: With dead ends: 38 [2019-01-20 10:01:53,984 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:01:53,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:01:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:01:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-20 10:01:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:01:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-20 10:01:53,993 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-20 10:01:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:53,993 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-20 10:01:53,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:01:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-20 10:01:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:01:53,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:53,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:01:53,994 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:53,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:53,994 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-20 10:01:53,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:53,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:53,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:53,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:53,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:54,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:54,058 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:01:54,058 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-20 10:01:54,062 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:54,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:54,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:54,068 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:01:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:54,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:54,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,069 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:54,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:54,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:54,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:54,106 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-20 10:01:54,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-20 10:01:54,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 21 [2019-01-20 10:01:54,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-20 10:01:54,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:54,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-20 10:01:54,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:01:54,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-20 10:01:54,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:01:54,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,230 INFO L267 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-01-20 10:01:54,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-20 10:01:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:54,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:54,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:54,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:01:54,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:54,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:01:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:01:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:01:54,312 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-20 10:01:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:54,642 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-20 10:01:54,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:01:54,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:01:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:54,643 INFO L225 Difference]: With dead ends: 45 [2019-01-20 10:01:54,643 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:01:54,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:01:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:01:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-20 10:01:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:01:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-20 10:01:54,654 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-20 10:01:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:54,655 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-20 10:01:54,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:01:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-20 10:01:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:01:54,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:54,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:01:54,656 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-20 10:01:54,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:54,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:54,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:54,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:54,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:54,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:54,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:01:54,724 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-20 10:01:54,726 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:54,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:54,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:54,729 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:01:54,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:54,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:54,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,731 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:54,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:54,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:54,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:54,751 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:54,759 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:01:54,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:01:54,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,817 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:01:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:01:54,828 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:01:54,845 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-20 10:01:54,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:01:54,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:54,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-20 10:01:54,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:54,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:01:54,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,005 INFO L267 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-01-20 10:01:55,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-20 10:01:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:55,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:55,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:55,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:01:55,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:55,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:01:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:01:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:01:55,118 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-20 10:01:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:55,279 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-20 10:01:55,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:01:55,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:01:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:55,282 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:01:55,282 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:01:55,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:01:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:01:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-20 10:01:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 10:01:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-20 10:01:55,293 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-20 10:01:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:55,294 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-20 10:01:55,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:01:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-20 10:01:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:01:55,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:55,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:01:55,295 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-20 10:01:55,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:55,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:55,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:55,458 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-20 10:01:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:55,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:55,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:55,515 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:01:55,516 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-20 10:01:55,518 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:55,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:55,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:55,522 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:01:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:55,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:55,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:55,522 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:55,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:55,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:55,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:55,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:55,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:55,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:55,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:01:55,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:55,634 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,659 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:55,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:01:55,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,694 INFO L267 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-01-20 10:01:55,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:55,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:01:55,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:01:55,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,726 INFO L267 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-01-20 10:01:55,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-20 10:01:55,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:55,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:01:55,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:55,779 INFO L267 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-01-20 10:01:55,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-20 10:01:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:55,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:55,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:55,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:01:55,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:55,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:01:55,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:01:55,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:01:55,865 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-20 10:01:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:56,051 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-20 10:01:56,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:01:56,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:01:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:56,053 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:01:56,053 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:01:56,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:01:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:01:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-20 10:01:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:01:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-20 10:01:56,064 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-20 10:01:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:56,064 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-20 10:01:56,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:01:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-20 10:01:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:01:56,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:56,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:01:56,065 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-20 10:01:56,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:56,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:56,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:56,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:56,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:56,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:56,275 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:01:56,275 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-20 10:01:56,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:56,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:56,281 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:56,281 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:01:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:56,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:56,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:56,282 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:56,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:56,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:56,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:56,304 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:56,309 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-20 10:01:56,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-20 10:01:56,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,345 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-20 10:01:56,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-20 10:01:56,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,370 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,379 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-20 10:01:56,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:01:56,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:01:56,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:01:56,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-20 10:01:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-20 10:01:56,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:56,505 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:01:56,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:01:56,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:01:56,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-20 10:01:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:56,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:56,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:56,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-20 10:01:56,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:56,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:01:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:01:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:01:56,632 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-20 10:01:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:56,957 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-20 10:01:56,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:01:56,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:01:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:56,958 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:01:56,959 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:01:56,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:01:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:01:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-20 10:01:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:01:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-20 10:01:56,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-20 10:01:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:56,968 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-20 10:01:56,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:01:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-20 10:01:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:01:56,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:56,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:01:56,969 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-20 10:01:56,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:56,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:56,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:56,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:01:57,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:57,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:57,080 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:01:57,080 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-20 10:01:57,081 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:01:57,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:01:57,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:01:57,084 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:01:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:57,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:01:57,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:57,085 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:57,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:57,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:57,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:57,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:01:57,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-20 10:01:57,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-20 10:01:57,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-20 10:01:57,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-20 10:01:57,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,195 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-20 10:01:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:01:57,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,332 INFO L267 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-01-20 10:01:57,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:01:57,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:01:57,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,364 INFO L267 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-01-20 10:01:57,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-20 10:01:57,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,387 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:01:57,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:01:57,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:01:57,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,407 INFO L267 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-01-20 10:01:57,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-20 10:01:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:57,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:57,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:57,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:01:57,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:57,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:01:57,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:01:57,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:01:57,483 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-20 10:01:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:57,726 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-20 10:01:57,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:01:57,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:01:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:57,727 INFO L225 Difference]: With dead ends: 22 [2019-01-20 10:01:57,728 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:01:57,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:01:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:01:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:01:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:01:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:01:57,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-20 10:01:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:57,730 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:01:57,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:01:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:01:57,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:01:57,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:01:57,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:01:57,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:01:57,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:01:57,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:01:57,875 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-20 10:01:59,029 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-20 10:01:59,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:01:59,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-20 10:01:59,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:01:59,033 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-01-20 10:01:59,033 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-20 10:01:59,033 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-20 10:01:59,033 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-20 10:01:59,033 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-20 10:01:59,033 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-20 10:01:59,043 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:01:59 BoogieIcfgContainer [2019-01-20 10:01:59,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-20 10:01:59,044 INFO L168 Benchmark]: Toolchain (without parser) took 13028.57 ms. Allocated memory was 139.5 MB in the beginning and 319.8 MB in the end (delta: 180.4 MB). Free memory was 106.9 MB in the beginning and 148.7 MB in the end (delta: -41.8 MB). Peak memory consumption was 138.5 MB. Max. memory is 7.1 GB. [2019-01-20 10:01:59,044 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:01:59,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.99 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 104.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-01-20 10:01:59,045 INFO L168 Benchmark]: Boogie Preprocessor took 26.19 ms. Allocated memory is still 139.5 MB. Free memory was 104.5 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:01:59,045 INFO L168 Benchmark]: RCFGBuilder took 416.81 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 93.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-01-20 10:01:59,046 INFO L168 Benchmark]: TraceAbstraction took 12524.97 ms. Allocated memory was 139.5 MB in the beginning and 319.8 MB in the end (delta: 180.4 MB). Free memory was 93.4 MB in the beginning and 148.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. [2019-01-20 10:01:59,048 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.18 ms. Allocated memory is still 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.99 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 104.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.19 ms. Allocated memory is still 139.5 MB. Free memory was 104.5 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.81 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 93.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12524.97 ms. Allocated memory was 139.5 MB in the beginning and 319.8 MB in the end (delta: 180.4 MB). Free memory was 93.4 MB in the beginning and 148.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 12.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...