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-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:23:19,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:23:19,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:23:19,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:23:19,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:23:19,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:23:19,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:23:19,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:23:19,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:23:19,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:23:19,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:23:19,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:23:19,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:23:19,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:23:19,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:23:19,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:23:19,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:23:19,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:23:19,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:23:19,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:23:19,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:23:19,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:23:19,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:23:19,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:23:19,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:23:19,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:23:19,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:23:19,119 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:23:19,120 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:23:19,121 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:23:19,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:23:19,122 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:23:19,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:23:19,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:23:19,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:23:19,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:23:19,125 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:23:19,138 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:23:19,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:23:19,139 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:23:19,139 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:23:19,139 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:23:19,140 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:23:19,140 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:23:19,140 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:23:19,140 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:23:19,140 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:23:19,140 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:23:19,141 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:23:19,141 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:23:19,141 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:23:19,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:23:19,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:23:19,142 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:23:19,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:23:19,142 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:23:19,143 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:23:19,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:23:19,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:23:19,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:23:19,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:23:19,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:23:19,144 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:23:19,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:23:19,144 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:23:19,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:23:19,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:23:19,145 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:23:19,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:23:19,145 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:23:19,145 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:23:19,146 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:23:19,146 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:23:19,146 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:23:19,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:23:19,146 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:23:19,146 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:23:19,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:23:19,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:23:19,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:23:19,200 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:23:19,201 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:23:19,201 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-02-28 10:23:19,202 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-02-28 10:23:19,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:23:19,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:23:19,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:23:19,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:23:19,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:23:19,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:23:19,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:23:19,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:23:19,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:23:19,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/1) ... [2019-02-28 10:23:19,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:23:19,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:23:19,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:23:19,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:23:19,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:23:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:23:19,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:23:19,845 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:23:19,845 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-28 10:23:19,846 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:23:19 BoogieIcfgContainer [2019-02-28 10:23:19,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:23:19,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:23:19,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:23:19,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:23:19,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:23:19" (1/2) ... [2019-02-28 10:23:19,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a926f1e and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:23:19, skipping insertion in model container [2019-02-28 10:23:19,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:23:19" (2/2) ... [2019-02-28 10:23:19,854 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-02-28 10:23:19,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:23:19,877 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-28 10:23:19,901 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-28 10:23:19,938 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:23:19,938 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:23:19,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:23:19,939 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:23:19,939 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:23:19,939 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:23:19,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:23:19,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:23:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-28 10:23:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:23:19,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:19,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:23:19,980 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-28 10:23:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:20,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:23:20,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:23:20,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:20,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:23:20,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:23:20,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:23:20,239 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-28 10:23:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:20,439 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-28 10:23:20,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:23:20,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:23:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:20,456 INFO L225 Difference]: With dead ends: 33 [2019-02-28 10:23:20,456 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:23:20,459 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-02-28 10:23:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:23:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-28 10:23:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:23:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-28 10:23:20,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-28 10:23:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:20,499 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-28 10:23:20,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:23:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-28 10:23:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:23:20,500 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:20,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:23:20,500 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-28 10:23:20,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:20,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:20,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:23:20,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:23:20,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:20,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:23:20,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:23:20,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:23:20,612 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-28 10:23:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:20,855 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 10:23:20,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:23:20,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:23:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:20,858 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:23:20,858 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:23:20,860 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-02-28 10:23:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:23:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-28 10:23:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:23:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-28 10:23:20,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-28 10:23:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:20,865 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-28 10:23:20,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:23:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-28 10:23:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:23:20,866 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:20,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:23:20,866 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-28 10:23:20,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:20,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:20,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:20,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:20,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:20,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:23:20,986 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-28 10:23:21,022 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:21,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:21,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:21,091 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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-02-28 10:23:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:21,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:21,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:21,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:21,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:21,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:21,144 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:23:21,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:21,669 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:21,671 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,698 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,728 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,887 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,976 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,063 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,216 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-28 10:23:22,227 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:22,236 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:22,250 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:22,271 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:22,302 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:22,630 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:22,632 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,701 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,721 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,744 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,765 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,889 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,904 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,967 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:22,968 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:23,058 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:23,059 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,185 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:23,186 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:23:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:23,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:23,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:23,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:23:23,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:23,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:23:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:23:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:23,276 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-28 10:23:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:23,846 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-28 10:23:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:23:23,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:23:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:23,850 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:23:23,850 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:23:23,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:23:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:23:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-28 10:23:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:23:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-28 10:23:23,857 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-28 10:23:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:23,857 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-28 10:23:23,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:23:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-28 10:23:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:23:23,858 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:23,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:23:23,858 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:23,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:23,859 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-28 10:23:23,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:23,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:23,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:23,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:23,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:23,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:23,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:23,929 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:23:23,929 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-28 10:23:23,933 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:23,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:23,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:23,943 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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-02-28 10:23:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:23,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:23,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:23,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:23,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:23,960 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:23:23,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:23,983 INFO L442 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 24 treesize of output 27 [2019-02-28 10:23:23,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,995 INFO L442 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 27 treesize of output 29 [2019-02-28 10:23:24,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,015 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:24,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,079 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:24,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,109 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,110 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,113 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,118 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,120 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:24,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,141 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,144 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,146 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,150 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,155 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:24,159 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,160 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,163 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,166 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,167 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,168 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,170 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,171 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,177 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,183 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,240 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:24,243 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,260 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,280 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,322 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,339 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,358 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,376 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,473 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:24,475 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,491 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,516 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,575 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,594 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,624 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,676 INFO L315 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:24,676 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:24,783 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:24,784 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,848 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:24,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-28 10:23:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:24,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:24,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:23:24,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:23:24,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:24,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:23:24,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:23:24,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:23:24,889 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-28 10:23:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:24,963 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-28 10:23:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:23:24,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:23:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:24,965 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:23:24,965 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:23:24,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:23:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:23:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-28 10:23:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:23:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-28 10:23:24,972 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-28 10:23:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:24,973 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-28 10:23:24,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:23:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-28 10:23:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:23:24,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:24,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:23:24,974 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-28 10:23:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:24,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:25,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:25,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:25,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:23:25,054 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-28 10:23:25,055 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:25,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:25,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:25,064 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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-02-28 10:23:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:25,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:25,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:25,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:25,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:25,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:25,081 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:23:25,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:25,089 INFO L442 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 24 treesize of output 27 [2019-02-28 10:23:25,095 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,096 INFO L442 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 27 treesize of output 29 [2019-02-28 10:23:25,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,122 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,123 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:25,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,141 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:25,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,160 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,162 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,164 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,167 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,168 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,168 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,169 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,170 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,172 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:25,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,184 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,185 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,185 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,202 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:25,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,250 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,258 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,343 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:25,346 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,449 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,465 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,483 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,500 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,530 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,547 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,715 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:25,716 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,724 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,732 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,748 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,767 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,797 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,899 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:25,899 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:25,980 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:25,981 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:26,337 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:26,338 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:23:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:26,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:26,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:26,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:23:26,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:26,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:23:26,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:23:26,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:26,401 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-28 10:23:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:26,753 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-28 10:23:26,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:23:26,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:23:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:26,757 INFO L225 Difference]: With dead ends: 57 [2019-02-28 10:23:26,757 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:23:26,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-02-28 10:23:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:23:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-28 10:23:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:23:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-28 10:23:26,765 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-28 10:23:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:26,766 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-28 10:23:26,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:23:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-28 10:23:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:23:26,766 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:26,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:23:26,767 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-28 10:23:26,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:26,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:26,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:26,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:26,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:26,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:23:26,865 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-28 10:23:26,868 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:26,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:26,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:26,875 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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-02-28 10:23:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:26,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:26,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:26,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:26,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:26,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:23:26,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:26,901 INFO L442 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 24 treesize of output 27 [2019-02-28 10:23:26,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,907 INFO L442 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 27 treesize of output 29 [2019-02-28 10:23:26,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,918 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:26,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,934 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:26,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:26,996 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:27,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,058 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,060 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:27,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,152 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:27,153 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,173 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,194 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,216 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,239 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,260 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,279 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,379 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:27,380 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,388 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,402 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,419 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,448 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,486 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,545 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:27,545 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:27,619 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:27,620 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,687 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:27,687 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:23:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:27,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:27,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:27,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:23:27,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:27,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:23:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:23:27,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:27,738 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-28 10:23:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:28,085 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-28 10:23:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:23:28,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:23:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:28,087 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:23:28,087 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:23:28,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:23:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-28 10:23:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:23:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-28 10:23:28,095 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-28 10:23:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:28,095 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-28 10:23:28,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:23:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-28 10:23:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:23:28,096 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:28,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:23:28,097 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-28 10:23:28,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:28,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:28,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:28,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:28,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:28,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:23:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:23:28,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:23:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:23:28,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:23:28,200 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-02-28 10:23:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:28,436 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-02-28 10:23:28,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:23:28,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:23:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:28,437 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:23:28,437 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:23:28,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:23:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:23:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-02-28 10:23:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:23:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-02-28 10:23:28,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-02-28 10:23:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:28,445 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-02-28 10:23:28,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:23:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-02-28 10:23:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:23:28,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:28,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:23:28,447 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-28 10:23:28,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:28,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:28,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:28,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:28,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:28,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:28,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:28,617 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:23:28,618 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-28 10:23:28,621 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:28,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:28,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:28,639 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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-02-28 10:23:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:28,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:28,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:28,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:28,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:28,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:28,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:23:28,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:28,728 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:28,728 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,778 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,794 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,816 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,843 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,894 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,933 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-28 10:23:28,936 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:28,939 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:28,943 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:28,947 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:28,950 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:29,003 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:29,005 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,019 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,034 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,048 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,063 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,078 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,092 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,142 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:29,142 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:29,183 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:29,184 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,238 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:29,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:23:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:29,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:29,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:23:29,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:23:29,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:29,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:23:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:23:29,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:23:29,313 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-02-28 10:23:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:29,371 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-02-28 10:23:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:23:29,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:23:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:29,373 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:23:29,373 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:23:29,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:23:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:23:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-28 10:23:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:23:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-02-28 10:23:29,382 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-02-28 10:23:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:29,382 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-02-28 10:23:29,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:23:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-02-28 10:23:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:23:29,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:29,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:23:29,384 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:29,384 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-28 10:23:29,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:29,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:29,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:29,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:29,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:29,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:29,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:29,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:23:29,475 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-28 10:23:29,478 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:29,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:29,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:29,485 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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-02-28 10:23:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:29,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:29,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:29,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:29,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:29,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:29,505 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:23:29,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:29,511 INFO L442 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 24 treesize of output 27 [2019-02-28 10:23:29,515 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,516 INFO L442 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 27 treesize of output 29 [2019-02-28 10:23:29,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,528 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:29,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,552 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,563 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,564 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,565 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:29,568 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,587 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:29,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,615 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,617 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,642 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:29,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,651 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,653 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,655 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,656 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,658 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,712 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:29,714 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,739 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,756 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,771 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,784 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,821 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,835 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,917 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:29,918 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,922 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,930 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,942 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,963 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,992 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,044 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:30,045 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:30,129 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:30,130 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,248 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:30,249 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-02-28 10:23:30,290 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-02-28 10:23:30,291 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,663 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:30,663 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-28 10:23:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:30,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:30,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:30,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:30,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:30,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:30,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:30,739 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-02-28 10:23:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:31,355 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-02-28 10:23:31,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:31,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:23:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:31,357 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:23:31,357 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:23:31,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:23:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-02-28 10:23:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:23:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-28 10:23:31,368 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-28 10:23:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:31,368 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-28 10:23:31,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-28 10:23:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:23:31,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:31,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:23:31,369 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-28 10:23:31,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:31,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:31,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:31,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:31,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:31,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:23:31,542 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-28 10:23:31,543 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:31,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:31,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:31,548 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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-02-28 10:23:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:31,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:31,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:31,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:31,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:31,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:31,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:23:31,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:31,572 INFO L442 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 24 treesize of output 27 [2019-02-28 10:23:31,576 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,577 INFO L442 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 27 treesize of output 29 [2019-02-28 10:23:31,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,586 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:31,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,605 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:31,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,633 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:31,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,642 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,643 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,645 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,653 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,656 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,658 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:31,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,681 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,729 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:31,731 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,747 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,774 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,790 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,807 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,821 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,838 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,934 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:31,935 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,940 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,952 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,967 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,988 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,017 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,065 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:32,066 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:32,157 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:32,158 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,201 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:32,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-02-28 10:23:32,242 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-02-28 10:23:32,243 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,286 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:32,286 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-02-28 10:23:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:32,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:32,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:32,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:32,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:32,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:32,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:32,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:32,396 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-28 10:23:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:32,909 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-28 10:23:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:32,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:23:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:32,911 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:23:32,911 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:23:32,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:23:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-02-28 10:23:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:23:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-28 10:23:32,922 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-28 10:23:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:32,922 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-28 10:23:32,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-28 10:23:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:23:32,923 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:32,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:23:32,923 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:32,924 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-28 10:23:32,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:32,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:32,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:32,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:33,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:33,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:33,038 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:23:33,038 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-28 10:23:33,042 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:33,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:33,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:33,047 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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-02-28 10:23:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:33,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:33,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:33,048 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-02-28 10:23:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:33,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:33,069 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:23:33,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:33,157 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:33,158 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,164 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,179 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,197 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,219 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,254 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,294 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-28 10:23:33,298 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:33,300 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:33,304 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:33,310 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:33,314 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:33,407 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:33,408 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,427 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,440 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,605 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,790 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,857 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,869 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,919 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:33,920 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:33,977 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:23:33,977 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,019 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:34,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-02-28 10:23:34,060 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-02-28 10:23:34,061 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,112 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:34,113 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-02-28 10:23:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:34,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:34,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:34,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:34,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:34,174 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-28 10:23:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:34,739 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-28 10:23:34,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:34,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:23:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:34,740 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:23:34,740 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:23:34,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:23:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-02-28 10:23:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:23:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-02-28 10:23:34,751 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-02-28 10:23:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:34,752 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-02-28 10:23:34,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-02-28 10:23:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:23:34,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:34,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:23:34,753 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-28 10:23:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:34,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:34,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:34,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:34,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:23:34,876 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-28 10:23:34,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:34,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:34,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:34,883 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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-02-28 10:23:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:34,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:34,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:34,884 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-02-28 10:23:34,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:34,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:34,902 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:23:34,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:34,911 INFO L442 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 24 treesize of output 27 [2019-02-28 10:23:34,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,915 INFO L442 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 27 treesize of output 29 [2019-02-28 10:23:34,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,997 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:23:35,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,047 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:23:35,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,169 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,217 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,277 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,278 INFO L289 Elim1Store]: Index analysis took 213 ms [2019-02-28 10:23:35,279 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:23:35,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,394 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,415 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,464 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,507 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,545 INFO L289 Elim1Store]: Index analysis took 251 ms [2019-02-28 10:23:35,546 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:23:35,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,550 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,552 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,558 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,559 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,560 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,562 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,563 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,564 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,565 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,609 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:23:35,611 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,625 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,641 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,658 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,674 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,691 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,707 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,780 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:23:35,780 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,784 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,789 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,804 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,825 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,853 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,903 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:35,904 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:23:36,030 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-02-28 10:23:36,032 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-28 10:23:36,108 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-28 10:23:36,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:152 [2019-02-28 10:23:36,308 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-02-28 10:23:36,400 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-02-28 10:23:36,402 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,565 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 121 [2019-02-28 10:23:36,578 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-02-28 10:23:37,078 INFO L315 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-28 10:23:37,079 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:487 [2019-02-28 10:26:53,810 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:53,812 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 57495 column 7: Overflow encountered when expanding vector at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-02-28 10:26:53,816 INFO L168 Benchmark]: Toolchain (without parser) took 214556.71 ms. Allocated memory was 142.1 MB in the beginning and 343.9 MB in the end (delta: 201.9 MB). Free memory was 109.5 MB in the beginning and 155.7 MB in the end (delta: -46.1 MB). Peak memory consumption was 155.7 MB. Max. memory is 7.1 GB. [2019-02-28 10:26:53,817 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:26:53,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.02 ms. Allocated memory is still 142.1 MB. Free memory was 109.3 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:26:53,818 INFO L168 Benchmark]: Boogie Preprocessor took 43.15 ms. Allocated memory is still 142.1 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:26:53,819 INFO L168 Benchmark]: RCFGBuilder took 469.08 ms. Allocated memory is still 142.1 MB. Free memory was 105.7 MB in the beginning and 93.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:26:53,819 INFO L168 Benchmark]: TraceAbstraction took 213968.03 ms. Allocated memory was 142.1 MB in the beginning and 343.9 MB in the end (delta: 201.9 MB). Free memory was 93.3 MB in the beginning and 155.7 MB in the end (delta: -62.4 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:26:53,821 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.20 ms. Allocated memory is still 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.02 ms. Allocated memory is still 142.1 MB. Free memory was 109.3 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.15 ms. Allocated memory is still 142.1 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.08 ms. Allocated memory is still 142.1 MB. Free memory was 105.7 MB in the beginning and 93.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 213968.03 ms. Allocated memory was 142.1 MB in the beginning and 343.9 MB in the end (delta: 201.9 MB). Free memory was 93.3 MB in the beginning and 155.7 MB in the end (delta: -62.4 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 57495 column 7: Overflow encountered when expanding vector de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 57495 column 7: Overflow encountered when expanding vector: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (1)] Forcibly destroying the process Received shutdown request...