java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:53:30,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:30,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:30,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:30,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:30,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:30,938 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:30,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:30,941 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:30,942 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:30,943 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:30,943 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:30,944 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:30,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:30,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:30,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:30,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:30,950 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:30,952 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:30,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:30,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:30,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:30,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:30,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:30,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:30,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:30,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:30,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:30,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:30,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:30,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:30,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:30,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:30,977 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:30,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:30,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:30,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-03-04 16:53:30,991 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:30,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:30,992 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:30,993 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:30,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:30,993 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:30,993 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:30,994 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:30,994 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:30,994 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:30,994 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:30,994 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:30,995 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:30,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:30,996 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:30,996 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:30,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:30,996 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:30,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:30,997 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:30,997 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:30,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:30,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:30,997 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:30,998 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:30,998 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:30,998 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:30,998 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:30,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:30,999 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:30,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:30,999 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:30,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:30,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:31,000 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:31,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:31,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:31,000 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:31,000 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:31,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:31,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:31,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:31,059 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:31,060 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:31,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-03-04 16:53:31,061 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-03-04 16:53:31,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:31,107 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:31,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:31,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:31,108 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:31,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:31,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:31,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:31,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:31,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... [2019-03-04 16:53:31,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:31,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:31,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:31,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:31,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:53:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:53:31,639 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:53:31,639 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-03-04 16:53:31,640 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:31 BoogieIcfgContainer [2019-03-04 16:53:31,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:31,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:31,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:31,645 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:31,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:31" (1/2) ... [2019-03-04 16:53:31,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c1833 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:31, skipping insertion in model container [2019-03-04 16:53:31,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:31" (2/2) ... [2019-03-04 16:53:31,649 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-03-04 16:53:31,659 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:31,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-03-04 16:53:31,686 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-03-04 16:53:31,718 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:31,718 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:31,719 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:31,719 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:31,719 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:31,719 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:31,719 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:31,720 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-03-04 16:53:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:53:31,750 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:31,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:53:31,756 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-03-04 16:53:31,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:31,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:31,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:31,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:31,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:31,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:32,003 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-03-04 16:53:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:32,147 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-03-04 16:53:32,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:32,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:53:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:32,165 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:53:32,166 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:53:32,169 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-03-04 16:53:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:53:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-03-04 16:53:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:53:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-03-04 16:53:32,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-03-04 16:53:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:32,202 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-03-04 16:53:32,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-03-04 16:53:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:32,203 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:32,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:32,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-03-04 16:53:32,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:32,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:32,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:32,298 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-03-04 16:53:32,366 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:32,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:35,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:35,823 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:35,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:35,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,831 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-03-04 16:53:35,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:35,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:35,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:53:35,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:35,970 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:36,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,028 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:36,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,135 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:36,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:36,305 INFO L301 Elim1Store]: Index analysis took 138 ms [2019-03-04 16:53:36,307 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:36,308 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,371 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,406 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,439 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,706 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:36,707 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,751 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,787 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,808 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:36,921 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:36,922 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:37,012 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:37,013 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:37,291 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:37,295 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:37,481 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-03-04 16:53:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:37,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:37,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:37,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:37,674 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-03-04 16:53:37,889 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-03-04 16:53:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:38,164 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-03-04 16:53:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:38,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:53:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:38,165 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:53:38,165 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:53:38,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:53:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:53:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-03-04 16:53:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:53:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-03-04 16:53:38,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-03-04 16:53:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:38,173 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-03-04 16:53:38,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-03-04 16:53:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:38,173 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:38,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:38,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-03-04 16:53:38,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:38,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:38,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:38,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:38,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:38,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:38,240 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-03-04 16:53:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:38,468 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-03-04 16:53:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:38,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:38,469 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:53:38,470 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:53:38,470 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-03-04 16:53:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:53:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:53:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:53:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-03-04 16:53:38,475 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-03-04 16:53:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:38,476 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-03-04 16:53:38,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-03-04 16:53:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:38,476 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:38,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:38,477 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-03-04 16:53:38,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:38,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:38,612 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:38,612 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-03-04 16:53:38,616 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:38,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:38,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:38,863 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:38,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:38,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:38,864 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-03-04 16:53:38,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:38,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:38,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:53:38,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:38,927 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:38,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:38,969 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:39,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:39,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:39,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:39,060 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:39,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:39,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:39,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:39,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:53:39,112 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,129 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,142 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,153 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,213 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:53:39,214 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,217 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,226 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,249 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:39,250 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-03-04 16:53:39,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:53:39,310 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,324 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:39,324 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-03-04 16:53:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:53:39,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:53:39,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:39,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:39,510 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-03-04 16:53:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:39,565 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-03-04 16:53:39,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:39,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:53:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:39,566 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:53:39,567 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:53:39,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:53:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-03-04 16:53:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:53:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-03-04 16:53:39,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-03-04 16:53:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:39,573 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-03-04 16:53:39,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-03-04 16:53:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:39,574 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:39,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:39,574 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:39,574 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-03-04 16:53:39,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:39,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:39,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:39,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:39,629 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:39,630 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-03-04 16:53:39,633 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:39,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:39,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:39,866 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:39,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:39,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,867 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-03-04 16:53:39,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:39,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:39,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:53:39,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:39,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:53:39,985 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,988 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,996 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:53:40,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:53:40,062 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:40,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:53:40,148 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,164 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,188 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,200 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,219 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:40,220 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-03-04 16:53:40,260 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:53:40,261 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:40,301 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:40,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:22 [2019-03-04 16:53:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:40,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:40,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:40,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:40,375 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-03-04 16:53:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:40,556 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-03-04 16:53:40,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:40,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:53:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:40,557 INFO L225 Difference]: With dead ends: 32 [2019-03-04 16:53:40,557 INFO L226 Difference]: Without dead ends: 31 [2019-03-04 16:53:40,558 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-03-04 16:53:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-03-04 16:53:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-03-04 16:53:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:53:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-03-04 16:53:40,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-03-04 16:53:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:40,565 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-03-04 16:53:40,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-03-04 16:53:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:40,566 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:40,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:40,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-03-04 16:53:40,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:40,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:40,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:40,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:40,659 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-03-04 16:53:40,661 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:40,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:42,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:42,582 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:42,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:42,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:42,582 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-03-04 16:53:42,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:42,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:42,618 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:53:42,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:42,669 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:42,670 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,672 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,682 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,695 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,715 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:53:42,719 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:53:42,729 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:53:42,738 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:42,739 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,753 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,762 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,770 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,789 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:42,790 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:42,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:42,831 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:42,876 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:42,876 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:42,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:42,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:53:42,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:53:42,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:42,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:53:42,925 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-03-04 16:53:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:42,964 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-03-04 16:53:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:42,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:53:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:42,966 INFO L225 Difference]: With dead ends: 22 [2019-03-04 16:53:42,966 INFO L226 Difference]: Without dead ends: 21 [2019-03-04 16:53:42,966 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-03-04 16:53:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-03-04 16:53:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-03-04 16:53:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:53:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-03-04 16:53:42,972 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-03-04 16:53:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:42,972 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-03-04 16:53:42,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-03-04 16:53:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:42,973 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:42,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:42,973 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-03-04 16:53:42,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:42,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:43,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:43,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:43,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:43,048 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-03-04 16:53:43,051 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:43,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:43,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:43,647 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:53:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:43,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:43,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:43,648 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-03-04 16:53:43,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:43,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:43,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:53:43,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:43,680 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:43,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,692 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:43,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,709 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:43,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:43,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:43,738 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,747 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,759 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,771 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,804 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:43,804 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,807 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,813 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,844 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:43,871 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:43,896 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:43,896 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,915 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:43,916 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:43,951 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:53:43,952 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,966 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:43,966 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-03-04 16:53:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:43,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:44,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:44,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:44,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:44,067 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-03-04 16:53:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:44,377 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-03-04 16:53:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:53:44,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:53:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:44,379 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:53:44,379 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:53:44,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:53:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:53:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-03-04 16:53:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:53:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-03-04 16:53:44,386 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-03-04 16:53:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:44,387 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-03-04 16:53:44,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-03-04 16:53:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:44,387 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:44,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:44,388 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:44,388 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-03-04 16:53:44,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:44,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:44,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:44,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:44,461 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:44,461 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-03-04 16:53:44,463 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:44,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:45,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:45,079 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:53:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:45,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:45,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,080 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-03-04 16:53:45,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:45,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:45,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:53:45,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:45,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:45,134 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,143 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,154 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,171 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:53:45,194 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:53:45,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:53:45,234 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:45,234 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,246 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,252 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,260 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,278 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:45,278 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:45,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:45,306 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:45,324 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:45,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:53:45,368 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,381 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:45,382 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:53:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,399 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:45,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:45,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:45,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:45,588 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-03-04 16:53:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:45,941 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-03-04 16:53:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:53:45,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:53:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:45,943 INFO L225 Difference]: With dead ends: 46 [2019-03-04 16:53:45,943 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:53:45,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:53:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:53:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-03-04 16:53:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:53:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-03-04 16:53:45,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-03-04 16:53:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:45,957 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-03-04 16:53:45,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-03-04 16:53:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:45,958 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:45,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:45,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-03-04 16:53:45,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:46,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:46,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:46,098 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-03-04 16:53:46,101 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:46,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:46,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:46,619 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:53:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:46,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:46,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:46,620 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-03-04 16:53:46,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:46,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:46,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:53:46,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:46,639 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:46,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,649 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:46,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,667 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:46,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:46,694 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:46,695 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,709 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,720 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,730 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:46,766 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,778 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,787 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,797 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,816 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:46,817 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:46,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:46,870 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,888 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:46,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:53:46,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:53:46,922 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:46,935 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:46,936 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:53:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,964 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:46,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:53:46,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:46,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:53:46,998 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-03-04 16:53:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:47,213 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-03-04 16:53:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:53:47,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:53:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:47,215 INFO L225 Difference]: With dead ends: 52 [2019-03-04 16:53:47,215 INFO L226 Difference]: Without dead ends: 49 [2019-03-04 16:53:47,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:53:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-03-04 16:53:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-03-04 16:53:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:53:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-03-04 16:53:47,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-03-04 16:53:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:47,225 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-03-04 16:53:47,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-03-04 16:53:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:47,226 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:47,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:47,226 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-03-04 16:53:47,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:47,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:47,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:47,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:47,290 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:47,290 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-03-04 16:53:47,291 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:47,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:47,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:47,415 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:47,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:47,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:47,415 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-03-04 16:53:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:47,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:47,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:53:47,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:47,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:53:47,450 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,458 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,467 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,481 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:53:47,489 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:53:47,498 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:47,523 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:53:47,524 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,551 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,559 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,569 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,581 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:47,582 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-03-04 16:53:47,610 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:53:47,611 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:47,636 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:47,636 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-03-04 16:53:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:47,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:47,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:47,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:47,694 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-03-04 16:53:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:47,844 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-03-04 16:53:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:47,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:53:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:47,846 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:53:47,846 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:53:47,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:53:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:53:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-03-04 16:53:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:53:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-03-04 16:53:47,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-03-04 16:53:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:47,856 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-03-04 16:53:47,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-03-04 16:53:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:47,857 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:47,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:47,857 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:47,857 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-03-04 16:53:47,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:47,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:47,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:47,915 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-03-04 16:53:47,918 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:47,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:48,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:48,129 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:53:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:48,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:48,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:48,129 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-03-04 16:53:48,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:48,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:48,148 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:53:48,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:48,153 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:48,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,162 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:48,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,182 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:48,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:48,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:48,207 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,218 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,227 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,235 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,264 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:48,265 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,269 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,275 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,286 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:48,305 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:48,331 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:48,332 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,349 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:48,349 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:48,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:53:48,378 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,390 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:48,390 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:53:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:48,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:48,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:48,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:48,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:48,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:48,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:48,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:48,447 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-03-04 16:53:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:48,783 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-03-04 16:53:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:53:48,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:53:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:48,784 INFO L225 Difference]: With dead ends: 52 [2019-03-04 16:53:48,784 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:53:48,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:53:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:53:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-03-04 16:53:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:53:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-03-04 16:53:48,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-03-04 16:53:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:48,795 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-03-04 16:53:48,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-03-04 16:53:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:48,795 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:48,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:48,796 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-03-04 16:53:48,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:48,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:48,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:48,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:48,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:48,829 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:48,830 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-03-04 16:53:48,832 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:48,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:48,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:48,958 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:48,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:48,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:48,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:48,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:48,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:48,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:53:48,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:48,978 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:49,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:53:49,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:49,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:49,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:53:49,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:49,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:49,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:49,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:49,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:49,047 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:49,047 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,054 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,063 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,097 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,139 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:53:49,140 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,151 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,175 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,207 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:49,207 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-03-04 16:53:49,251 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:49,251 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,278 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:49,279 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-03-04 16:53:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:49,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:49,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:49,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:49,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:49,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:49,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:49,350 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-03-04 16:53:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:49,496 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-03-04 16:53:49,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:49,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:53:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:49,498 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:53:49,498 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:53:49,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:53:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:53:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-03-04 16:53:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:53:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-03-04 16:53:49,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-03-04 16:53:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:49,508 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-03-04 16:53:49,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-03-04 16:53:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:49,509 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:49,509 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:53:49,510 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-03-04 16:53:49,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:49,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:49,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:53:49,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:49,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:49,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:49,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:49,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:49,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:49,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:49,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:53:49,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:49,616 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:53:49,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:49,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:49,657 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,667 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,675 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,687 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:53:49,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:53:49,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:53:49,718 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:49,718 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,725 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,733 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,741 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,760 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:49,760 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:49,778 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:49,779 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,827 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:49,828 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:49,908 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 37 [2019-03-04 16:53:49,910 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:49,922 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:49,923 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 [2019-03-04 16:53:49,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:53:49,999 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,014 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:50,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:53:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:50,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:53:50,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:50,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:53:50,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:53:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:53:50,079 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-03-04 16:53:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:50,459 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-03-04 16:53:50,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:53:50,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:53:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:50,460 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:53:50,460 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:53:50,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:53:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-03-04 16:53:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:53:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-03-04 16:53:50,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-03-04 16:53:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:50,472 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-03-04 16:53:50,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:53:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-03-04 16:53:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:50,473 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:50,473 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:53:50,474 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:50,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:50,474 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-03-04 16:53:50,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:53:50,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:50,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:50,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:50,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:50,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:50,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:53:50,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:50,590 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:53:50,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:50,603 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:50,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,609 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:50,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,645 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:50,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:50,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:50,662 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,671 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,683 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,690 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,723 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:50,723 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,728 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,734 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,744 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,763 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:50,763 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:50,786 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:50,786 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:50,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:50,949 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-03-04 16:53:50,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:53:50,983 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,999 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:50,999 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:35 [2019-03-04 16:53:51,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:53:51,028 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:51,041 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:51,041 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:53:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:51,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-03-04 16:53:51,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:51,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:53:51,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:53:51,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:53:51,138 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-03-04 16:53:51,362 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-03-04 16:53:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:51,601 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-03-04 16:53:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:53:51,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:53:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:51,602 INFO L225 Difference]: With dead ends: 53 [2019-03-04 16:53:51,602 INFO L226 Difference]: Without dead ends: 51 [2019-03-04 16:53:51,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:53:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-03-04 16:53:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-03-04 16:53:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:53:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-03-04 16:53:51,612 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-03-04 16:53:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:51,612 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-03-04 16:53:51,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:53:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-03-04 16:53:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:51,613 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:51,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:53:51,613 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-03-04 16:53:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:51,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:51,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:51,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:53:51,666 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-03-04 16:53:51,669 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:51,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:52,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:52,180 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:53:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:52,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:52,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:52,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:52,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:52,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:52,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:53:52,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:52,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:52,273 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,282 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,290 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,300 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,317 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:53:52,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:53:52,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:53:52,331 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:52,331 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,338 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,346 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,354 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,375 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:52,375 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:52,411 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:52,411 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,458 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:52,459 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:52,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:53:52,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:52,506 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:52,507 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:53:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:52,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:52,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:52,578 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-03-04 16:53:52,868 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-03-04 16:53:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:53,049 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-03-04 16:53:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:53:53,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:53:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:53,050 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:53:53,051 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:53:53,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:53:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:53:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-03-04 16:53:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:53:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-03-04 16:53:53,062 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-03-04 16:53:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:53,062 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-03-04 16:53:53,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-03-04 16:53:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:53,063 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:53,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:53:53,063 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:53,064 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-03-04 16:53:53,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:53,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:53,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:53,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:53:53,200 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-03-04 16:53:53,202 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:53,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:53,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:53,777 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:53:53,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:53,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:53,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:53,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:53,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:53,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:53:53,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:53,799 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:53,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,806 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:53,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,817 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:53,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:53,891 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:53:53,892 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,900 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,908 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,917 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:53:53,943 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,949 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,955 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,968 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:53,968 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-03-04 16:53:54,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 47 [2019-03-04 16:53:54,012 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:53:54,067 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-03-04 16:53:54,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:126 [2019-03-04 16:53:54,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:53:54,155 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:54,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:53:54,220 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:54,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:53:54,301 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:54,364 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-03-04 16:53:54,364 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:71 [2019-03-04 16:53:54,802 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-03-04 16:53:54,984 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 30 [2019-03-04 16:53:54,985 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:55,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 39 [2019-03-04 16:53:55,784 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:55,953 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:53:55,955 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:55,983 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-03-04 16:53:55,983 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-03-04 16:53:56,293 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-03-04 16:53:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:56,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:56,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:56,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-03-04 16:53:56,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:56,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:53:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:53:56,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:56,332 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-03-04 16:53:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:57,126 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-03-04 16:53:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:53:57,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:53:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:57,127 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:53:57,127 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:53:57,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:53:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:53:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-03-04 16:53:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:53:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-03-04 16:53:57,141 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-03-04 16:53:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:57,141 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-03-04 16:53:57,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:53:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-03-04 16:53:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:57,142 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:57,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:53:57,142 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-03-04 16:53:57,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:57,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:57,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:57,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:57,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:57,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:57,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:57,222 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:53:57,222 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-03-04 16:53:57,224 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:57,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:57,909 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:57,909 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:53:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:57,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:57,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:57,910 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:57,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:57,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:57,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:53:57,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:57,943 INFO L453 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 15 treesize of output 18 [2019-03-04 16:53:57,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,949 INFO L453 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 18 treesize of output 20 [2019-03-04 16:53:57,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,958 INFO L453 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 20 treesize of output 22 [2019-03-04 16:53:57,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:53:57,976 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:57,977 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:57,986 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,000 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,008 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:53:58,169 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,186 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,193 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,203 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,221 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,221 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:53:58,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:53:58,248 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,285 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:58,285 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:53:58,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:53:58,321 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,334 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:58,335 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-03-04 16:53:58,385 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-03-04 16:53:58,386 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:58,404 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:58,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:53:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:58,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:53:58,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:58,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:53:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:53:58,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:58,477 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-03-04 16:53:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:58,917 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-03-04 16:53:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:53:58,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:53:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:58,919 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:53:58,919 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:53:58,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:53:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-03-04 16:53:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:53:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-03-04 16:53:58,937 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-03-04 16:53:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:58,937 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-03-04 16:53:58,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:53:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-03-04 16:53:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:58,938 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:58,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:53:58,938 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-03-04 16:53:58,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:59,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:59,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:59,030 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:53:59,031 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-03-04 16:53:59,032 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:59,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:59,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:59,513 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:53:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:59,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:59,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:59,514 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:59,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:59,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:59,560 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:53:59,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:59,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:53:59,590 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,601 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,616 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:53:59,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:53:59,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:53:59,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:53:59,672 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,684 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,701 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,717 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,742 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:59,742 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-03-04 16:53:59,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:53:59,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,785 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:59,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:53:59,807 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:53:59,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:59,815 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:59,815 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-03-04 16:53:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:59,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:59,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:59,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:53:59,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:59,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:59,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:53:59,876 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-03-04 16:54:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:00,093 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-03-04 16:54:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:00,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:00,096 INFO L225 Difference]: With dead ends: 62 [2019-03-04 16:54:00,096 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:54:00,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:54:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-03-04 16:54:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:54:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-03-04 16:54:00,110 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-03-04 16:54:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:00,110 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-03-04 16:54:00,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-03-04 16:54:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:00,111 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:00,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:00,111 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-03-04 16:54:00,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:00,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:00,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:00,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:54:00,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:54:00,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:00,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:00,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:54:00,214 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-03-04 16:54:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:00,285 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-03-04 16:54:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:54:00,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:54:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:00,286 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:54:00,286 INFO L226 Difference]: Without dead ends: 46 [2019-03-04 16:54:00,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-03-04 16:54:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-03-04 16:54:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:54:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-03-04 16:54:00,302 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-03-04 16:54:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:00,302 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-03-04 16:54:00,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-03-04 16:54:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:00,303 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:00,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:00,303 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-03-04 16:54:00,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:00,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:00,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:00,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:00,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:00,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:00,402 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:00,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:00,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:00,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:00,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:00,418 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:00,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:00,425 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:00,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,431 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:00,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,449 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:00,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:00,461 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:00,461 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,469 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,476 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,484 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:00,556 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,579 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,688 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,728 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:00,745 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:00,770 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:00,771 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,787 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:00,787 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:00,817 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:54:00,817 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,830 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:00,830 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:00,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:00,870 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,880 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:00,880 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:54:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:00,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:00,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:00,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:00,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:00,945 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-03-04 16:54:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:01,642 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-03-04 16:54:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:01,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:54:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:01,647 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:54:01,647 INFO L226 Difference]: Without dead ends: 87 [2019-03-04 16:54:01,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:54:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-03-04 16:54:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-03-04 16:54:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:54:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-03-04 16:54:01,668 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-03-04 16:54:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:01,668 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-03-04 16:54:01,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-03-04 16:54:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:01,669 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:01,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:01,669 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:01,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:01,670 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-03-04 16:54:01,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:01,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:01,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:01,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:01,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:01,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:01,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:01,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:01,736 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-03-04 16:54:01,736 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:01,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:02,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:02,040 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:02,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:02,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,041 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:02,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:02,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:02,073 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:02,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:02,098 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:02,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,131 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:02,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,142 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:02,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:02,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:02,166 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,174 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,183 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,191 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,220 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:02,221 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,223 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,228 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,237 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,256 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:02,256 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:02,277 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:02,277 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,314 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:02,315 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:02,340 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:54:02,341 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:02,352 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:02,352 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:02,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:02,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:02,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:02,398 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-03-04 16:54:02,558 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-03-04 16:54:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:02,691 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-03-04 16:54:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:02,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:02,693 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:54:02,693 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:54:02,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:54:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-03-04 16:54:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-03-04 16:54:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-03-04 16:54:02,710 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-03-04 16:54:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:02,710 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-03-04 16:54:02,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-03-04 16:54:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:02,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:02,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:02,711 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-03-04 16:54:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:02,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:02,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:02,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:02,749 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:54:02,749 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-03-04 16:54:02,750 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:02,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:03,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:03,012 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:03,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:03,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:03,013 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:03,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:03,048 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:03,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:03,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:03,187 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,189 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,197 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,210 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,227 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:03,262 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:03,265 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:03,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:03,268 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,277 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,286 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,295 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,334 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:03,335 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:03,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:03,357 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,372 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:03,372 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:03,401 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:03,402 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,415 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:03,415 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:54:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:03,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:54:03,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:03,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:54:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:54:03,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:03,470 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-03-04 16:54:03,603 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-03-04 16:54:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:03,780 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-03-04 16:54:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:03,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-03-04 16:54:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:03,785 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:54:03,785 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:54:03,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:54:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-03-04 16:54:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:54:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-03-04 16:54:03,804 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-03-04 16:54:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:03,804 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-03-04 16:54:03,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:54:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-03-04 16:54:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:54:03,805 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:03,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:54:03,805 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-03-04 16:54:03,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:03,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:03,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:03,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:03,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:03,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:03,994 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:04,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:04,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:04,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:54:04,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:04,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:04,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:04,018 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:04,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,044 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:04,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,051 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:04,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:04,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:04,062 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,071 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,080 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,089 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:04,119 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,121 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,127 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,137 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,156 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:04,156 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:04,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:04,176 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,191 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:04,191 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:04,220 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:04,221 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,235 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:04,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:04,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:04,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:04,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:04,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:04,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:04,297 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-03-04 16:54:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:04,522 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-03-04 16:54:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:04,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:54:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:04,523 INFO L225 Difference]: With dead ends: 86 [2019-03-04 16:54:04,523 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:54:04,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:54:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-03-04 16:54:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:54:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-03-04 16:54:04,545 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-03-04 16:54:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:04,545 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-03-04 16:54:04,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-03-04 16:54:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:04,546 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:04,546 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-03-04 16:54:04,547 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-03-04 16:54:04,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:04,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:04,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:54:04,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:04,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:04,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:04,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:04,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:04,657 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:04,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:04,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:04,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:04,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:04,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:04,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:04,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:04,698 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,704 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,716 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,732 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:04,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:04,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:04,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:04,782 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,792 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,804 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,814 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,832 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:04,833 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:04,850 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:04,851 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,884 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:04,884 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:04,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 49 [2019-03-04 16:54:04,974 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:04,990 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:04,990 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:35 [2019-03-04 16:54:05,020 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:05,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,033 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:05,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:05,085 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-03-04 16:54:05,086 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,097 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:05,098 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:05,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-03-04 16:54:05,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:05,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:05,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:05,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:54:05,173 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-03-04 16:54:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:05,593 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-03-04 16:54:05,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:05,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:05,595 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:54:05,595 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:54:05,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:54:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-03-04 16:54:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:54:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-03-04 16:54:05,621 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-03-04 16:54:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:05,621 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-03-04 16:54:05,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-03-04 16:54:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:05,621 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:05,621 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:54:05,622 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:05,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-03-04 16:54:05,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:05,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:05,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:05,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:05,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:05,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:05,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:05,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:05,704 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:05,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:05,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:05,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:05,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:05,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:05,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:05,745 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:05,745 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,754 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,765 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,776 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,792 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:05,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:05,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:05,803 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:05,803 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,811 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,818 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,827 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,846 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:05,846 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:05,868 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:05,869 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,887 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:05,887 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:05,938 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 49 [2019-03-04 16:54:05,939 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:05,955 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:05,956 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:35 [2019-03-04 16:54:06,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:06,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:06,216 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:06,216 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:06,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:06,321 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:06,330 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:06,330 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-03-04 16:54:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:06,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:54:06,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:06,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:54:06,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:54:06,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:06,448 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-03-04 16:54:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:06,885 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-03-04 16:54:06,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:06,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:54:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:06,887 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:54:06,887 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:54:06,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:54:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-03-04 16:54:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-03-04 16:54:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-03-04 16:54:06,920 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-03-04 16:54:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:06,920 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-03-04 16:54:06,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:54:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-03-04 16:54:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:06,921 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:06,921 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:54:06,921 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:06,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-03-04 16:54:06,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:07,250 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:54:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:07,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:07,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:07,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:07,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:07,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:07,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:07,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:07,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:07,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:07,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:07,551 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:07,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,556 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:07,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,563 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:07,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:07,574 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:07,575 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,584 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,592 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,601 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:07,632 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,636 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,645 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,656 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,675 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:07,675 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:07,699 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:07,699 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,732 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:07,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:07,768 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:07,769 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,783 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:07,783 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:07,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-03-04 16:54:07,829 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,840 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:07,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:07,883 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:07,883 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:07,896 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:07,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-03-04 16:54:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:07,916 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:07,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:07,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:54:07,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:07,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:54:07,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:54:07,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:07,987 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-03-04 16:54:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:08,400 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-03-04 16:54:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:08,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:54:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:08,403 INFO L225 Difference]: With dead ends: 116 [2019-03-04 16:54:08,403 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:54:08,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:54:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-03-04 16:54:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:54:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-03-04 16:54:08,428 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-03-04 16:54:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:08,428 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-03-04 16:54:08,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:54:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-03-04 16:54:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:08,428 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:08,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:08,429 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-03-04 16:54:08,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:08,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:08,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:08,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:08,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:08,586 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:54:08,986 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-03-04 16:54:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:08,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:08,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:08,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:08,987 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-03-04 16:54:08,988 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:08,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:09,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:09,562 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:09,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:09,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:09,563 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:09,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:09,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:09,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:09,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:09,585 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:09,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,595 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:09,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,637 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:09,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:09,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:09,655 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,666 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,682 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,692 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:09,724 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,730 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,738 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,748 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,767 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:09,767 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:09,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:09,790 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:09,808 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:09,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:09,852 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:09,866 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:09,867 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:09,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:09,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:09,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:09,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:09,924 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-03-04 16:54:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:10,208 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-03-04 16:54:10,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:10,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:54:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:10,209 INFO L225 Difference]: With dead ends: 72 [2019-03-04 16:54:10,209 INFO L226 Difference]: Without dead ends: 67 [2019-03-04 16:54:10,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-03-04 16:54:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-03-04 16:54:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:54:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-03-04 16:54:10,234 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-03-04 16:54:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:10,235 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-03-04 16:54:10,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-03-04 16:54:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:10,235 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:10,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:10,236 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:10,236 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-03-04 16:54:10,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:10,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:10,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:10,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:10,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:10,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:10,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:10,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:10,298 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-03-04 16:54:10,300 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:10,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:10,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:10,906 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:10,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:10,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:10,906 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:10,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:10,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:10,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:10,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:10,925 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:10,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,933 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:10,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,952 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:10,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:10,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:10,974 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,983 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,992 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,000 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:11,031 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,036 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,045 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,056 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,074 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:11,074 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:11,107 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:11,107 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,123 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:11,124 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:11,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:11,155 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,168 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:11,169 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:11,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:11,209 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:11,220 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:11,220 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:54:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:11,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:11,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:11,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:11,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:11,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:11,280 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-03-04 16:54:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:11,628 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-03-04 16:54:11,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:11,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:11,630 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:54:11,630 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:54:11,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:54:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-03-04 16:54:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:54:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-03-04 16:54:11,663 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-03-04 16:54:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:11,663 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-03-04 16:54:11,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-03-04 16:54:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:11,663 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:11,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:11,664 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-03-04 16:54:11,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:11,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:11,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:11,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:11,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:11,741 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-03-04 16:54:11,742 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:11,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:12,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:12,325 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:12,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:12,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:12,325 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:12,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:12,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:12,340 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:12,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:12,344 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:12,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,387 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:12,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,490 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:12,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:12,656 INFO L301 Elim1Store]: Index analysis took 136 ms [2019-03-04 16:54:12,657 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:12,657 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,755 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,866 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:12,992 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:13,025 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,030 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,036 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,046 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,063 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,064 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:13,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:13,089 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,107 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:13,107 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:13,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:13,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,161 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:13,161 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:13,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:13,202 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:13,212 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:13,213 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:13,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:13,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:13,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:13,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:13,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:13,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:13,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:13,290 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-03-04 16:54:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:13,623 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-03-04 16:54:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:13,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:13,625 INFO L225 Difference]: With dead ends: 78 [2019-03-04 16:54:13,625 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:54:13,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:54:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-03-04 16:54:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:54:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-03-04 16:54:13,657 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-03-04 16:54:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:13,657 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-03-04 16:54:13,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-03-04 16:54:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:13,658 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:13,658 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:54:13,658 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:13,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-03-04 16:54:13,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:13,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:13,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:13,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:13,719 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:13,720 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-03-04 16:54:13,721 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:13,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:14,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:14,304 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:14,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:14,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:14,305 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:14,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:14,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:14,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:14,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:14,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:14,352 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,363 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,379 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,388 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,403 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:14,406 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:14,409 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:14,412 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:14,413 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,420 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,428 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,436 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,454 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:14,454 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:14,476 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:14,477 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,493 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:14,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:14,527 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:14,528 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,540 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:14,541 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:14,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:54:14,589 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,601 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:14,601 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:14,642 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:14,643 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,656 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:14,656 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:14,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:14,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:14,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:54:14,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:14,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:54:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:54:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:14,773 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-03-04 16:54:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:15,301 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-03-04 16:54:15,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:15,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:54:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:15,302 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:54:15,303 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:54:15,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:54:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-03-04 16:54:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:54:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-03-04 16:54:15,331 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-03-04 16:54:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:15,331 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-03-04 16:54:15,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:54:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-03-04 16:54:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:15,332 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:15,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:15,332 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-03-04 16:54:15,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:15,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:15,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:15,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:15,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:15,477 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:15,478 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-03-04 16:54:15,479 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:15,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:15,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:15,810 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:15,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:15,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:15,811 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:15,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:15,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:15,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:15,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:15,852 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:15,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,861 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:15,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,878 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:15,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:15,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:15,893 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,901 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,910 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,918 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:15,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:15,975 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,031 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,041 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,051 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,070 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:16,071 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:16,091 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:16,092 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,110 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:16,110 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:16,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:16,157 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:16,170 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:16,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:16,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:16,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:16,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-03-04 16:54:16,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:16,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:54:16,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:54:16,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:16,247 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-03-04 16:54:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:17,047 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-03-04 16:54:17,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:17,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:54:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:17,049 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:54:17,049 INFO L226 Difference]: Without dead ends: 87 [2019-03-04 16:54:17,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-03-04 16:54:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-03-04 16:54:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-03-04 16:54:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-03-04 16:54:17,088 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-03-04 16:54:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:17,088 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-03-04 16:54:17,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:54:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-03-04 16:54:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:17,089 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:17,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:17,089 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-03-04 16:54:17,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:17,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:17,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:17,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:17,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:17,188 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:17,189 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-03-04 16:54:17,191 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:17,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:17,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:17,449 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:17,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:17,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:17,450 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:17,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:17,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:17,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:54:17,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:17,491 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:17,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,498 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:17,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,506 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:17,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:17,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:54:17,555 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,562 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,571 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,579 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:17,601 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,603 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,609 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,622 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:17,622 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-03-04 16:54:17,649 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:54:17,650 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,658 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:17,659 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-03-04 16:54:17,687 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:54:17,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:17,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-03-04 16:54:17,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 35 [2019-03-04 16:54:17,731 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:17,740 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:17,741 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:22 [2019-03-04 16:54:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:17,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:17,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:17,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:17,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:17,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:17,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:17,799 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-03-04 16:54:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:18,104 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-03-04 16:54:18,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:18,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:54:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:18,106 INFO L225 Difference]: With dead ends: 122 [2019-03-04 16:54:18,106 INFO L226 Difference]: Without dead ends: 121 [2019-03-04 16:54:18,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-03-04 16:54:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-03-04 16:54:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-03-04 16:54:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-03-04 16:54:18,156 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-03-04 16:54:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:18,156 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-03-04 16:54:18,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-03-04 16:54:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:18,157 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:18,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:18,158 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-03-04 16:54:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:18,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:18,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:18,293 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:54:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:18,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:18,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:18,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:18,330 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-03-04 16:54:18,331 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:18,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:18,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:18,754 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:18,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:18,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:18,754 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:18,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:18,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:18,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:54:18,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:18,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:18,788 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,794 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,811 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:18,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:18,876 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:18,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:18,882 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,898 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,904 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,912 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,929 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:18,929 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-03-04 16:54:18,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:54:18,958 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:18,969 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:18,969 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:54:18,995 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:54:18,996 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,004 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:19,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:54:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,021 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:19,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:19,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:19,062 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-03-04 16:54:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:19,279 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-03-04 16:54:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:54:19,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:54:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:19,282 INFO L225 Difference]: With dead ends: 113 [2019-03-04 16:54:19,282 INFO L226 Difference]: Without dead ends: 108 [2019-03-04 16:54:19,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-03-04 16:54:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-03-04 16:54:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:54:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-03-04 16:54:19,335 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-03-04 16:54:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:19,335 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-03-04 16:54:19,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-03-04 16:54:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:19,336 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:19,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:19,336 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-03-04 16:54:19,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:19,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:19,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:19,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:19,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:19,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:19,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:19,493 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:19,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:19,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:19,493 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:19,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:19,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:19,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:19,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:19,508 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:19,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:19,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:19,528 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,533 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,543 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,553 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,567 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:19,570 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:19,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:19,582 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:19,583 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,591 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,598 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,606 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,625 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:19,625 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:19,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:19,647 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,665 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:19,665 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:19,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:19,693 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,704 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:19,704 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:19,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:19,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,758 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:19,758 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:19,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:54:19,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:19,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:54:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:54:19,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:19,835 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-03-04 16:54:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:20,288 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-03-04 16:54:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:20,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:54:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:20,291 INFO L225 Difference]: With dead ends: 137 [2019-03-04 16:54:20,291 INFO L226 Difference]: Without dead ends: 136 [2019-03-04 16:54:20,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:54:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-03-04 16:54:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-03-04 16:54:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:54:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-03-04 16:54:20,364 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-03-04 16:54:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:20,364 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-03-04 16:54:20,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:54:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-03-04 16:54:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:20,365 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:20,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:20,365 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-03-04 16:54:20,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:20,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:20,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:20,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:20,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:20,546 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:20,546 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-03-04 16:54:20,547 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:20,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:20,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:20,981 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:20,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:20,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:20,981 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:20,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:20,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:20,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:54:20,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:21,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:54:21,010 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,018 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:21,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:21,081 INFO L453 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:54:21,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:21,087 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,094 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,101 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,109 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,122 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:21,122 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-03-04 16:54:21,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:54:21,144 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,148 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,149 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-03-04 16:54:21,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:54:21,172 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,177 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:21,177 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-03-04 16:54:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:21,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:21,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:21,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:54:21,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:21,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:21,223 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-03-04 16:54:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:21,425 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-03-04 16:54:21,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:21,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:54:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:21,427 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:54:21,428 INFO L226 Difference]: Without dead ends: 109 [2019-03-04 16:54:21,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-03-04 16:54:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-03-04 16:54:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-03-04 16:54:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-03-04 16:54:21,475 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-03-04 16:54:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:21,475 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-03-04 16:54:21,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-03-04 16:54:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:21,476 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:21,476 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:54:21,476 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-03-04 16:54:21,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:21,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:21,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:21,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:21,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:21,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:21,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:21,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:21,626 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:21,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:21,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:21,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:21,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:21,641 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:21,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:21,647 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:21,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,650 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:21,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,657 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:21,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:21,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:21,668 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,677 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,689 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,696 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:21,725 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,727 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,734 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,744 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,763 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:21,763 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:21,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:21,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,801 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:21,802 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:21,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:54:21,832 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,843 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:21,844 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:21,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:21,881 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,891 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:21,892 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:21,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:54:21,942 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:21,955 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:21,955 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:21,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:22,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:22,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:54:22,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:22,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:54:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:54:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:54:22,032 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-03-04 16:54:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:22,456 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-03-04 16:54:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:22,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:54:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:22,459 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:54:22,459 INFO L226 Difference]: Without dead ends: 116 [2019-03-04 16:54:22,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-03-04 16:54:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-03-04 16:54:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:54:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-03-04 16:54:22,514 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-03-04 16:54:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:22,514 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-03-04 16:54:22,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:54:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-03-04 16:54:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:22,515 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:22,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:22,515 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-03-04 16:54:22,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:22,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:22,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:22,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:22,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:22,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:54:22,591 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-03-04 16:54:22,592 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:22,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:23,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:23,232 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:54:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:23,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:23,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:23,233 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:23,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:23,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:23,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:23,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:23,252 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:23,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,264 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:23,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,290 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:23,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:23,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:23,305 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,313 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,322 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,330 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,359 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:23,360 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,364 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,370 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,380 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,397 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,397 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:23,421 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:23,421 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,437 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:23,437 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:23,470 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:23,471 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,483 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:23,483 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:23,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:23,521 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,544 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:23,545 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:54:23,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 47 [2019-03-04 16:54:23,593 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,604 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:23,605 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:54:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:23,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:23,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:54:23,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:23,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:54:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:54:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:23,680 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-03-04 16:54:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:24,174 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-03-04 16:54:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:24,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:54:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:24,176 INFO L225 Difference]: With dead ends: 137 [2019-03-04 16:54:24,176 INFO L226 Difference]: Without dead ends: 136 [2019-03-04 16:54:24,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:54:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-03-04 16:54:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-03-04 16:54:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:54:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-03-04 16:54:24,233 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-03-04 16:54:24,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:24,233 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-03-04 16:54:24,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:54:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-03-04 16:54:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:24,234 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:24,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:24,235 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-03-04 16:54:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:24,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:24,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:24,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:24,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:24,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:24,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:24,359 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:24,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:24,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:24,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:24,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:24,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:24,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:24,382 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:24,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,393 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:24,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,402 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:24,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:24,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:24,415 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,422 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,431 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,440 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,470 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:24,471 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,475 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,484 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,495 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,513 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:24,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:24,543 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,560 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:24,561 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:24,600 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:24,601 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,613 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:24,613 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-03-04 16:54:24,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 32 [2019-03-04 16:54:24,652 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,661 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:24,661 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:27 [2019-03-04 16:54:24,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:54:24,714 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:24,727 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:24,728 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-03-04 16:54:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:24,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:24,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:54:24,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:24,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:54:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:54:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:24,818 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-03-04 16:54:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:25,513 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-03-04 16:54:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:25,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:54:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:25,517 INFO L225 Difference]: With dead ends: 172 [2019-03-04 16:54:25,517 INFO L226 Difference]: Without dead ends: 167 [2019-03-04 16:54:25,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-03-04 16:54:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-03-04 16:54:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-03-04 16:54:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-03-04 16:54:25,591 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-03-04 16:54:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:25,591 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-03-04 16:54:25,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:54:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-03-04 16:54:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:54:25,592 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:25,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:54:25,592 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-03-04 16:54:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:25,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:25,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:25,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:25,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:25,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:25,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:25,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:25,777 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:25,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:25,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:25,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:25,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:25,791 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:25,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:25,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:25,834 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,868 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,875 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,885 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:25,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:25,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:25,909 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:25,910 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,918 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,925 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,933 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,951 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,952 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:25,979 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:25,980 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:25,997 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:25,997 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:26,032 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:26,033 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:26,048 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-03-04 16:54:26,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 36 [2019-03-04 16:54:26,091 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,103 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:26,103 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:27 [2019-03-04 16:54:26,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:54:26,152 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:26,163 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:26,163 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-03-04 16:54:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:26,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:26,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:26,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:54:26,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:26,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:54:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:54:26,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:26,251 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-03-04 16:54:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:26,701 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-03-04 16:54:26,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:26,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:54:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:26,704 INFO L225 Difference]: With dead ends: 140 [2019-03-04 16:54:26,704 INFO L226 Difference]: Without dead ends: 135 [2019-03-04 16:54:26,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:54:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-03-04 16:54:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-03-04 16:54:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:54:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-03-04 16:54:26,756 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-03-04 16:54:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:26,756 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-03-04 16:54:26,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:54:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-03-04 16:54:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:26,757 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:26,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:26,757 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:26,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-03-04 16:54:26,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:26,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:26,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:26,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:26,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:26,956 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-03-04 16:54:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:27,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:27,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:27,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:54:27,019 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-03-04 16:54:27,020 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:27,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:27,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:27,555 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:27,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:27,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:27,555 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:27,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:27,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:27,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:27,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:27,577 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:27,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,584 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:27,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,596 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:27,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:27,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:27,616 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,634 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,643 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,651 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,682 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:27,682 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,684 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,690 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,700 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,718 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,719 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:27,745 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:27,745 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,766 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:27,767 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:27,818 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:27,818 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,832 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:27,832 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:27,879 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:27,880 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,891 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:27,891 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:54:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:27,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:27,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:27,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:27,959 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-03-04 16:54:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:28,412 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-03-04 16:54:28,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:28,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:54:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:28,414 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:54:28,414 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:54:28,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:54:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-03-04 16:54:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-03-04 16:54:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-03-04 16:54:28,466 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-03-04 16:54:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:28,466 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-03-04 16:54:28,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-03-04 16:54:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:28,467 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:28,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:28,467 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-03-04 16:54:28,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:28,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:28,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:28,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:28,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:28,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:54:28,618 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-03-04 16:54:28,620 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:28,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:29,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:29,408 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:54:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:29,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:29,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:29,409 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:29,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:29,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:29,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:29,473 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:29,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,487 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:29,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,496 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:29,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:29,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:29,510 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,519 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,527 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,536 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:29,565 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,567 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,574 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,584 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,603 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:29,627 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:29,628 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,644 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:29,645 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:29,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:29,677 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,688 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:29,689 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:29,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:29,730 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,742 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:29,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:29,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:54:29,791 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:29,803 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:29,803 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-03-04 16:54:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:29,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:29,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:29,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:54:29,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:29,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:54:29,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:54:29,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:29,886 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-03-04 16:54:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:30,691 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-03-04 16:54:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:30,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:54:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:30,692 INFO L225 Difference]: With dead ends: 86 [2019-03-04 16:54:30,693 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:54:30,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:54:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:54:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-03-04 16:54:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-03-04 16:54:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-03-04 16:54:30,746 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-03-04 16:54:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:30,747 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-03-04 16:54:30,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:54:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-03-04 16:54:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:30,747 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:30,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:30,747 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-03-04 16:54:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:30,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:30,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:30,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:30,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:54:30,888 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-03-04 16:54:30,890 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:30,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:31,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:31,396 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:31,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:31,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:31,397 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:31,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:31,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:31,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:54:31,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:31,417 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:31,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:31,459 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:54:31,495 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:54:31,496 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,502 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,509 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,517 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,525 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:31,525 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-03-04 16:54:31,548 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:54:31,549 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:54:31,557 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 16:54:31,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2019-03-04 16:54:31,578 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2019-03-04 16:54:31,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,600 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:54:31,600 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:31,608 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:31,608 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:27 [2019-03-04 16:54:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:31,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:31,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:54:31,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-03-04 16:54:31,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:31,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:54:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:54:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:31,750 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-03-04 16:54:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:31,963 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-03-04 16:54:31,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:54:31,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:54:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:31,966 INFO L225 Difference]: With dead ends: 115 [2019-03-04 16:54:31,966 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:54:31,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:54:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:54:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-03-04 16:54:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:54:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-03-04 16:54:32,069 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-03-04 16:54:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:32,070 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-03-04 16:54:32,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:54:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-03-04 16:54:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:32,070 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:32,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:32,071 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-03-04 16:54:32,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:32,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:32,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:32,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:32,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:32,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:32,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:32,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:32,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:32,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:32,177 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:32,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:32,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:32,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:32,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:32,193 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:32,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:32,198 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:32,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,202 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:32,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,209 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:32,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:32,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:32,220 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,228 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,237 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,246 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:32,276 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,280 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,289 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,299 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,317 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,317 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:32,373 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:32,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,415 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:32,416 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:32,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:32,453 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,466 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:32,467 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-03-04 16:54:32,508 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-03-04 16:54:32,509 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,522 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:32,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:54:32,569 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 43 [2019-03-04 16:54:32,570 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,580 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:32,580 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:54:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:32,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:32,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:32,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:54:32,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:32,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:54:32,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:54:32,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:32,665 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-03-04 16:54:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:33,221 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-03-04 16:54:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:33,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:54:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:33,224 INFO L225 Difference]: With dead ends: 104 [2019-03-04 16:54:33,224 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:54:33,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:54:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-03-04 16:54:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:54:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-03-04 16:54:33,316 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-03-04 16:54:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:33,317 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-03-04 16:54:33,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:54:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-03-04 16:54:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:33,317 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:33,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:33,318 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:33,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-03-04 16:54:33,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:33,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:33,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:33,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:33,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:33,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:54:33,449 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-03-04 16:54:33,452 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:33,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:34,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:34,017 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:34,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:34,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:34,017 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:34,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:34,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:34,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:54:34,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:34,041 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:34,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:34,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:34,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:34,068 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:34,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:34,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:34,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:34,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:34,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:34,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:34,092 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,105 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,116 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,122 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:34,146 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,151 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,160 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,175 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:34,176 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-03-04 16:54:34,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:54:34,210 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,227 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:34,228 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:54:34,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:54:34,253 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,260 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:34,261 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-03-04 16:54:34,293 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:54:34,293 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:34,300 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:34,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-03-04 16:54:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:36,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:36,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:36,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=111, Unknown=1, NotChecked=0, Total=182 [2019-03-04 16:54:36,376 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-03-04 16:54:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:36,769 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-03-04 16:54:36,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:36,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:54:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:36,771 INFO L225 Difference]: With dead ends: 68 [2019-03-04 16:54:36,771 INFO L226 Difference]: Without dead ends: 67 [2019-03-04 16:54:36,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=88, Invalid=151, Unknown=1, NotChecked=0, Total=240 [2019-03-04 16:54:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-03-04 16:54:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-03-04 16:54:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-03-04 16:54:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-03-04 16:54:36,931 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-03-04 16:54:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:36,932 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-03-04 16:54:36,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-03-04 16:54:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:36,933 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:36,933 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:54:36,933 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-03-04 16:54:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:36,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:54:37,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:54:37,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:54:37,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:37,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:37,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:54:37,145 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-03-04 16:54:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:37,272 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-03-04 16:54:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:37,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-03-04 16:54:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:37,273 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:54:37,273 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:54:37,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:54:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:54:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-03-04 16:54:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-03-04 16:54:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-03-04 16:54:37,357 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-03-04 16:54:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:37,357 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-03-04 16:54:37,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-03-04 16:54:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:37,357 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:37,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:37,357 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-03-04 16:54:37,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:37,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:37,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:37,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:37,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:54:37,460 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-03-04 16:54:37,461 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:37,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:38,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:38,047 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:38,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:38,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:38,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:38,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:38,060 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:38,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:38,083 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:38,084 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,095 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,107 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,121 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:38,144 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:38,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:38,150 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:38,151 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,160 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,169 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,176 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,194 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:38,195 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:38,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:38,215 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,231 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:38,232 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:38,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:38,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,276 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:38,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:54:38,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 36 [2019-03-04 16:54:38,319 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,330 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:38,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:27 [2019-03-04 16:54:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:38,350 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:38,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:38,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:54:38,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:38,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:38,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:38,394 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-03-04 16:54:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:38,810 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-03-04 16:54:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:54:38,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:54:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:38,811 INFO L225 Difference]: With dead ends: 78 [2019-03-04 16:54:38,811 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:54:38,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:54:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-03-04 16:54:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:54:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-03-04 16:54:38,913 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-03-04 16:54:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:38,913 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-03-04 16:54:38,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-03-04 16:54:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:38,913 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:38,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:38,914 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-03-04 16:54:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:38,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:38,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:38,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:39,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:39,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:39,031 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:54:39,031 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-03-04 16:54:39,033 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:39,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:39,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:39,222 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:39,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:39,222 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:39,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:39,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:39,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:39,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:39,270 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:39,270 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,282 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,294 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,305 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:39,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:39,327 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:39,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:39,330 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,336 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,342 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,350 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,369 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:39,369 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:39,392 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:39,392 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,408 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:39,409 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:39,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:39,443 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:39,456 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:39,456 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:39,476 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:39,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:54:39,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:39,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:54:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:54:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:54:39,512 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-03-04 16:54:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:40,035 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-03-04 16:54:40,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:40,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:54:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:40,036 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:54:40,036 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:54:40,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:54:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-03-04 16:54:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-03-04 16:54:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-03-04 16:54:40,137 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-03-04 16:54:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:40,138 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-03-04 16:54:40,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:54:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-03-04 16:54:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:40,138 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:40,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:40,139 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:40,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:40,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-03-04 16:54:40,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:40,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:40,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:40,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:40,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:40,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:40,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:40,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:40,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:40,213 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:40,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:40,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:40,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:40,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:40,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:54:40,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:40,259 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:40,259 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,273 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,285 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:40,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:40,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:40,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:40,337 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,348 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,358 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,368 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,390 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:40,391 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-03-04 16:54:40,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:54:40,442 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,457 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:40,457 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:54:40,512 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:54:40,512 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,524 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:40,524 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-03-04 16:54:40,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:54:40,590 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:40,603 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:40,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-03-04 16:54:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:40,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:40,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:40,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:54:40,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:40,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:40,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:40,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:40,706 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-03-04 16:54:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:41,141 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-03-04 16:54:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:54:41,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:54:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:41,143 INFO L225 Difference]: With dead ends: 76 [2019-03-04 16:54:41,143 INFO L226 Difference]: Without dead ends: 67 [2019-03-04 16:54:41,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-03-04 16:54:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-03-04 16:54:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:54:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-03-04 16:54:41,264 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-03-04 16:54:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:41,264 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-03-04 16:54:41,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-03-04 16:54:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:54:41,265 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:41,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:41,265 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-03-04 16:54:41,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:41,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:41,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:41,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:41,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:41,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:54:41,390 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-03-04 16:54:41,391 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:41,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:41,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:41,601 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:41,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:41,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:41,602 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:41,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:41,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:41,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:54:41,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:41,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:54:41,631 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,648 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:41,684 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:41,701 INFO L453 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:54:41,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:41,709 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,716 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,722 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,729 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,742 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:41,742 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-03-04 16:54:41,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:54:41,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:54:41,804 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:41,804 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:36 [2019-03-04 16:54:41,857 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:54:41,858 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,891 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:54:41,892 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:41,909 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:41,909 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-03-04 16:54:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:41,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:41,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:41,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-03-04 16:54:41,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:41,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:54:41,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:54:41,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:54:41,972 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-03-04 16:54:42,678 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-03-04 16:54:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:43,171 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-03-04 16:54:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:43,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:54:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:43,173 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:54:43,173 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:54:43,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:54:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:54:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-03-04 16:54:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-03-04 16:54:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-03-04 16:54:43,369 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-03-04 16:54:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:43,369 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-03-04 16:54:43,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:54:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-03-04 16:54:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:54:43,370 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:43,370 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:43,370 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-03-04 16:54:43,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:43,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:43,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:43,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:43,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:43,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:43,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:54:43,521 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-03-04 16:54:43,522 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:43,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:43,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:43,968 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:43,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:43,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,968 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:43,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:43,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:43,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:54:43,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:43,989 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:43,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:43,997 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:44,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,006 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:44,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:44,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:44,022 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,034 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,045 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,055 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:44,086 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,089 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,095 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,105 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,124 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:44,124 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:44,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:44,143 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,159 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:44,160 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:44,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:44,186 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,198 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:44,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:44,243 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-03-04 16:54:44,244 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:44,255 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:44,256 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:44,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-03-04 16:54:44,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:44,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:54:44,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:54:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:54:44,323 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-03-04 16:54:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:45,020 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-03-04 16:54:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:54:45,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:54:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:45,022 INFO L225 Difference]: With dead ends: 118 [2019-03-04 16:54:45,022 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:54:45,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:54:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-03-04 16:54:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-03-04 16:54:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-03-04 16:54:45,227 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-03-04 16:54:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:45,227 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-03-04 16:54:45,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:54:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-03-04 16:54:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:54:45,227 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:45,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:45,228 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-03-04 16:54:45,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:45,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:45,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:45,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:45,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:54:45,347 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-03-04 16:54:45,348 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:45,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:45,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:45,995 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:54:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:45,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:45,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:45,995 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:46,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:46,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:46,009 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:46,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:46,022 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:46,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,030 INFO L453 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 18 treesize of output 20 [2019-03-04 16:54:46,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,042 INFO L453 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 20 treesize of output 22 [2019-03-04 16:54:46,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:46,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:46,061 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,072 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,082 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,091 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:46,120 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,125 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,134 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,145 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,164 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,165 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:46,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:46,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,208 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:46,209 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:46,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:54:46,242 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,254 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:46,254 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:46,294 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:46,294 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:46,304 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:46,353 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-03-04 16:54:46,354 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,363 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:46,364 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-03-04 16:54:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:46,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-03-04 16:54:46,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:46,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:54:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:54:46,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:46,448 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-03-04 16:54:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:47,332 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-03-04 16:54:47,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:54:47,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-03-04 16:54:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:47,333 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:54:47,334 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:54:47,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:54:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:54:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-03-04 16:54:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:54:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-03-04 16:54:47,616 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-03-04 16:54:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:47,616 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-03-04 16:54:47,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:54:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-03-04 16:54:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:54:47,617 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:47,617 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:47,617 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-03-04 16:54:47,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:47,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:47,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:54:47,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:47,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:47,695 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:54:47,695 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-03-04 16:54:47,696 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:47,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:47,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:47,900 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:54:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:47,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:47,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:47,900 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:47,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:47,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:47,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:54:47,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:47,920 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:47,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:47,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:54:48,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:48,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:48,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:48,043 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:48,043 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,050 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,059 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,067 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,085 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:54:48,085 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,091 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,102 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:48,103 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-03-04 16:54:48,136 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:54:48,137 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:54:48,154 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 16:54:48,155 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:39 [2019-03-04 16:54:48,204 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 19 [2019-03-04 16:54:48,205 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:54:48,242 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,256 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:48,257 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-03-04 16:54:48,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:54:48,295 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 28 [2019-03-04 16:54:48,324 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:48,338 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:48,338 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-03-04 16:54:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:48,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:48,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:48,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:54:48,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:48,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:54:48,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:54:48,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:54:48,420 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-03-04 16:54:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:49,071 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-03-04 16:54:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:54:49,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:54:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:49,073 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:54:49,073 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:54:49,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:54:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-03-04 16:54:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:54:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-03-04 16:54:49,376 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-03-04 16:54:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:49,377 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-03-04 16:54:49,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:54:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-03-04 16:54:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:54:49,378 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:49,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:49,378 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-03-04 16:54:49,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:49,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:54:49,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:49,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:49,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:49,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:49,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:49,574 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:49,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:49,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:49,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:54:49,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:49,590 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:54:49,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:49,597 INFO L453 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 15 treesize of output 18 [2019-03-04 16:54:49,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:54:49,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:49,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:49,618 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:49,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:49,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:49,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:49,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:49,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:54:49,645 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:49,645 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,655 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,664 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,672 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:54:49,698 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,704 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,713 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,729 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,730 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-03-04 16:54:49,763 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:54:49,764 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:54:49,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:49,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:62 [2019-03-04 16:54:49,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:54:49,875 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 39 [2019-03-04 16:54:49,927 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:49,951 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:49,952 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:56 [2019-03-04 16:54:50,015 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:54:50,016 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:54:50,049 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,073 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:50,074 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-03-04 16:54:50,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 28 [2019-03-04 16:54:50,125 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,183 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:54:50,183 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:50,205 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:54:50,206 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:52 [2019-03-04 16:54:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:50,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:50,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:50,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-03-04 16:54:50,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:50,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:54:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:54:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:54:50,318 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-03-04 16:54:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:51,692 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-03-04 16:54:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:54:51,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-03-04 16:54:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:51,694 INFO L225 Difference]: With dead ends: 186 [2019-03-04 16:54:51,694 INFO L226 Difference]: Without dead ends: 177 [2019-03-04 16:54:51,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:54:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-03-04 16:54:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-03-04 16:54:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-03-04 16:54:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-03-04 16:54:52,093 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-03-04 16:54:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:52,093 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-03-04 16:54:52,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:54:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-03-04 16:54:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:54:52,094 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:52,094 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:52,094 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-03-04 16:54:52,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:52,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:52,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:52,425 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-03-04 16:54:52,757 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-03-04 16:54:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:54:52,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:52,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:52,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:54:52,872 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-03-04 16:54:52,873 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:52,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:53,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:54:53,629 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:54:53,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:53,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:54:53,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:53,630 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:53,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:53,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:53,683 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:54:53,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:53,894 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:53,895 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:53,918 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,015 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,187 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:54,205 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:54,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:54,211 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:54,211 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,219 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,226 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,233 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,251 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:54,252 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:54,276 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:54,277 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,293 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:54,293 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:54:54,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:54:54,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,377 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:54,378 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:54:54,419 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:54,420 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,432 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:54,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:54,485 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:54:54,486 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:54,497 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:54,498 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-03-04 16:54:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:54,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:54,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:54,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:54:54,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:54,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:54:54,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:54:54,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:54:54,582 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-03-04 16:54:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:55,360 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-03-04 16:54:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:55,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:54:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:55,365 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:54:55,366 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:54:55,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:54:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:54:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-03-04 16:54:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:54:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-03-04 16:54:55,468 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-03-04 16:54:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:55,468 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-03-04 16:54:55,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:54:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-03-04 16:54:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:54:55,469 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:55,469 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:54:55,469 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-03-04 16:54:55,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:55,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:55,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-03-04 16:54:55,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:55,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:55,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:55,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:55,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:55,615 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:55,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:55,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:55,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:55,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:55,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:54:55,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:55,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:54:55,648 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,660 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,670 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,687 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,712 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:54:55,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 20 [2019-03-04 16:54:55,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:54:55,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:54:55,724 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,735 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,745 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,757 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,780 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,780 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-03-04 16:54:55,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:54:55,824 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,855 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:55,856 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:54:55,898 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:54:55,898 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:55,915 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:55,915 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:27 [2019-03-04 16:54:56,019 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:54:56,020 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:56,035 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:56,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-03-04 16:54:56,083 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-03-04 16:54:56,084 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:56,094 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:56,094 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-03-04 16:54:56,141 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-03-04 16:54:56,142 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:56,153 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:54:56,154 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:54:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:56,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-03-04 16:54:56,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:56,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:54:56,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:54:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:54:56,279 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-03-04 16:54:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:56,759 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-03-04 16:54:56,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:54:56,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 16:54:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:56,759 INFO L225 Difference]: With dead ends: 32 [2019-03-04 16:54:56,760 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:54:56,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:54:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:54:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:54:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:54:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:54:56,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-03-04 16:54:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:56,762 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:54:56,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:54:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:54:56,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:54:56,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:54:56,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:56,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:56,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:56,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:56,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:56,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:57,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:58,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:58,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:59,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:54:59,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:00,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:03,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:03,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:04,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:04,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:04,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:06,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:06,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:55:09,034 WARN L181 SmtUtils]: Spent 12.26 s on a formula simplification. DAG size of input: 1485 DAG size of output: 1015 [2019-03-04 16:55:21,848 WARN L181 SmtUtils]: Spent 12.79 s on a formula simplification. DAG size of input: 958 DAG size of output: 66 [2019-03-04 16:55:21,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:55:21,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-03-04 16:55:21,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-03-04 16:55:21,852 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-03-04 16:55:21,852 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-03-04 16:55:21,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-03-04 16:55:21,853 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse15 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse2 (- 1))))) (let ((.cse14 (select .cse15 ULTIMATE.start_main_p1)) (.cse7 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse16 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse3 (<= .cse16 0)) (.cse1 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) (.cse6 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse16 (- 1)))) (.cse10 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse7 1))) (.cse4 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse5 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse8 (= .cse14 0)) (.cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) .cse0 .cse1 (= .cse2 0) .cse3 (= .cse4 0) .cse5 .cse6 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (<= 0 .cse7)) (and (and .cse8 .cse0 (= 0 (select .cse9 ULTIMATE.start_main_p3)) .cse1 .cse3) (<= (+ (select .cse10 ULTIMATE.start_main_p4) 1) 0)) (and (<= .cse2 0) (let ((.cse13 (= (select .cse15 ULTIMATE.start_main_p2) 0))) (or (and (let ((.cse11 (<= 0 .cse4)) (.cse12 (<= (+ (select .cse10 ULTIMATE.start_main_p2) 1) 0))) (or (and .cse11 .cse12 (and .cse8 .cse1)) (and .cse13 .cse6 (<= 1 .cse14) .cse11) (and (<= 1 (select .cse9 ULTIMATE.start_main_p1)) .cse11 .cse12))) .cse5) (and .cse13 .cse8 .cse0 (<= 1 (select .cse15 ULTIMATE.start_main_p3))))))))))) [2019-03-04 16:55:21,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:55:21,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-03-04 16:55:21,853 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-03-04 16:55:21,853 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-03-04 16:55:21,878 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:55:21 BoogieIcfgContainer [2019-03-04 16:55:21,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:55:21,879 INFO L168 Benchmark]: Toolchain (without parser) took 110772.64 ms. Allocated memory was 141.0 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 107.4 MB in the beginning and 321.5 MB in the end (delta: -214.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-03-04 16:55:21,880 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:55:21,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.45 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 104.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:55:21,880 INFO L168 Benchmark]: Boogie Preprocessor took 26.61 ms. Allocated memory is still 141.0 MB. Free memory was 104.8 MB in the beginning and 103.9 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 7.1 GB. [2019-03-04 16:55:21,880 INFO L168 Benchmark]: RCFGBuilder took 440.56 ms. Allocated memory is still 141.0 MB. Free memory was 103.5 MB in the beginning and 93.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:55:21,881 INFO L168 Benchmark]: TraceAbstraction took 110237.06 ms. Allocated memory was 141.0 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 93.2 MB in the beginning and 321.5 MB in the end (delta: -228.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-03-04 16:55:21,882 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 141.0 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.45 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 104.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.61 ms. Allocated memory is still 141.0 MB. Free memory was 104.8 MB in the beginning and 103.9 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 440.56 ms. Allocated memory is still 141.0 MB. Free memory was 103.5 MB in the beginning and 93.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110237.06 ms. Allocated memory was 141.0 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 93.2 MB in the beginning and 321.5 MB in the end (delta: -228.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((!(p1 == p4) && !(p2 == p1)) && !(p3 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || (((((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p2 == p1)) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p3 == p1)) && #memory_int[p2] <= 0) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (#memory_int[p4] <= 0 && ((((((0 <= #memory_int[p3] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p3 == p1)) || (((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && !(p3 == p2)) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p3])) || ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0)) && !(p3 == p4)) || (((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p2 == p1)) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 110.1s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 23.9s AutomataDifference, 0.0s DeadEndRemovalTime, 25.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 20.8s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 256 HoareAnnotationTreeSize, 1 FomulaSimplifications, 3881304869 FormulaSimplificationTreeSizeReduction, 12.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 34117955 FormulaSimplificationTreeSizeReductionInter, 12.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91515 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...