java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:09:54,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:09:54,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:09:54,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:09:54,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:09:54,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:09:54,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:09:54,968 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:09:54,969 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:09:54,970 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:09:54,971 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:09:54,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:09:54,973 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:09:54,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:09:54,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:09:54,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:09:54,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:09:54,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:09:54,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:09:54,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:09:54,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:09:54,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:09:54,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:09:54,988 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:09:54,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:09:54,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:09:54,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:09:54,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:09:54,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:09:54,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:09:54,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:09:54,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:09:54,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:09:54,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:09:54,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:09:54,998 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:09:54,998 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 10:09:55,012 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:09:55,012 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:09:55,013 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:09:55,013 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:09:55,014 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:09:55,014 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:09:55,014 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:09:55,014 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:09:55,015 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:09:55,015 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:09:55,015 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:09:55,015 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:09:55,016 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:09:55,016 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:09:55,016 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:09:55,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:09:55,017 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:09:55,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:09:55,017 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:09:55,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:09:55,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:09:55,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:09:55,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:09:55,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:09:55,018 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:09:55,019 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:09:55,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:09:55,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:09:55,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:09:55,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:09:55,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:09:55,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:09:55,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:09:55,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:09:55,020 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:09:55,021 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:09:55,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:09:55,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:09:55,021 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:09:55,021 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:09:55,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:09:55,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:09:55,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:09:55,077 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:09:55,077 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:09:55,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-01-20 10:09:55,078 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-20 10:09:55,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:09:55,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:09:55,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:09:55,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:09:55,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:09:55,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:09:55,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:09:55,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:09:55,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:09:55,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... [2019-01-20 10:09:55,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:09:55,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:09:55,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:09:55,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:09:55,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:09:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:09:55,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:09:55,714 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:09:55,714 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-20 10:09:55,719 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:55 BoogieIcfgContainer [2019-01-20 10:09:55,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:09:55,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:09:55,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:09:55,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:09:55,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:55" (1/2) ... [2019-01-20 10:09:55,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0aac0 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:09:55, skipping insertion in model container [2019-01-20 10:09:55,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:55" (2/2) ... [2019-01-20 10:09:55,739 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-20 10:09:55,755 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:09:55,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-20 10:09:55,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-20 10:09:55,812 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:09:55,812 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:09:55,812 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:09:55,812 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:09:55,813 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:09:55,813 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:09:55,813 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:09:55,813 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:09:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-20 10:09:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:09:55,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:55,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:09:55,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-20 10:09:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:55,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:55,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:55,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:55,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:56,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:09:56,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:09:56,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:56,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:09:56,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:09:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:09:56,050 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-20 10:09:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:56,257 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-20 10:09:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:56,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:09:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:56,273 INFO L225 Difference]: With dead ends: 29 [2019-01-20 10:09:56,274 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:09:56,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:09:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:09:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-20 10:09:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:09:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-20 10:09:56,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-20 10:09:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:56,315 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-20 10:09:56,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:09:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-20 10:09:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:56,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:56,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:56,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-20 10:09:56,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:56,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:56,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:56,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:56,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:56,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:56,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:56,469 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:56,471 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-20 10:09:56,518 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:56,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:56,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:56,592 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:56,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:56,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:56,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:56,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:56,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:56,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:56,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:57,097 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-20 10:09:57,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:57,271 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-20 10:09:57,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:57,486 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-20 10:09:57,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:57,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:09:57,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:09:57,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:09:57,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:09:57,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:09:57,899 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-01-20 10:09:57,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:09:57,903 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,077 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,108 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,161 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,177 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:58,234 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:09:58,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:09:58,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:58,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:09:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:58,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:58,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:58,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:58,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:58,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:58,473 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-20 10:09:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:58,954 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-20 10:09:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:58,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:09:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:58,955 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:09:58,956 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:09:58,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:09:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:09:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-20 10:09:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:09:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-20 10:09:58,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-20 10:09:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:58,964 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-20 10:09:58,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-20 10:09:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:58,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:58,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:58,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:58,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:58,966 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-20 10:09:58,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:58,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:58,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:58,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:58,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:59,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:59,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:59,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:59,097 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-20 10:09:59,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:59,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:59,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:59,107 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:59,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:59,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:59,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:59,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:59,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:59,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:59,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:09:59,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:09:59,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:09:59,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:09:59,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:09:59,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:09:59,253 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:59,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:59,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:59,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:59,725 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,741 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,763 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,791 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:59,827 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-20 10:09:59,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:09:59,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:59,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:00,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:00,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:10:00,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:10:00,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:00,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:00,038 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-20 10:10:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:00,102 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-20 10:10:00,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:10:00,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:10:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:00,103 INFO L225 Difference]: With dead ends: 23 [2019-01-20 10:10:00,103 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 10:10:00,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 10:10:00,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-20 10:10:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:10:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-20 10:10:00,111 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-20 10:10:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:00,111 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-20 10:10:00,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-20 10:10:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:00,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:00,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:00,113 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-20 10:10:00,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:00,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:00,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:00,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:00,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:00,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:00,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:00,203 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-20 10:10:00,205 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:00,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:00,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:00,213 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:00,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:00,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:00,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:00,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:00,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:00,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:00,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:00,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:00,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:00,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:00,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:00,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:00,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:00,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:00,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:00,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:00,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:00,931 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,977 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,999 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,151 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,162 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:01,219 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:01,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:01,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:01,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:01,522 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-20 10:10:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:01,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:01,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:01,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:01,629 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-20 10:10:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:01,827 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-20 10:10:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:10:01,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:10:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:01,830 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:10:01,830 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:10:01,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:10:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-20 10:10:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:10:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-20 10:10:01,838 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-20 10:10:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:01,838 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-20 10:10:01,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-20 10:10:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:01,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:01,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:01,839 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:01,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:01,840 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-20 10:10:01,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:01,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:01,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:01,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:01,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:01,957 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-20 10:10:01,961 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:01,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:01,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:01,967 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:01,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:01,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:01,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:01,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:01,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:01,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:02,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:02,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:02,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:02,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:02,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:02,236 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-20 10:10:02,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:02,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:02,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:02,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:02,684 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,700 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,713 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:02,762 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:02,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:02,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:02,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:02,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:02,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-01-20 10:10:02,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:02,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:02,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:02,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:02,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:02,916 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-20 10:10:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:03,080 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-20 10:10:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:03,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:10:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:03,084 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:10:03,084 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:10:03,084 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-01-20 10:10:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:10:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-20 10:10:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:10:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-20 10:10:03,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-20 10:10:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:03,091 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-20 10:10:03,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-20 10:10:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:03,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:03,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:03,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:03,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:03,093 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-20 10:10:03,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:03,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:03,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:03,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:03,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:03,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:03,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:03,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:03,157 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-20 10:10:03,159 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:03,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:03,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:03,166 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:03,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:03,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:03,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:03,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:03,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:03,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:03,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:03,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:03,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:03,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:03,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:03,285 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:03,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:03,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:03,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:03,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,587 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,602 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:03,651 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:03,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:03,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,741 INFO L267 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-01-20 10:10:03,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:03,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:10:03,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:03,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:03,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:03,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:03,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:03,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:03,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:03,949 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-20 10:10:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:04,719 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-20 10:10:04,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:04,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:04,721 INFO L225 Difference]: With dead ends: 61 [2019-01-20 10:10:04,722 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:10:04,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:10:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-20 10:10:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:10:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-20 10:10:04,733 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-20 10:10:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:04,734 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-20 10:10:04,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-20 10:10:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:04,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:04,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:04,735 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-20 10:10:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:04,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:04,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:04,918 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-20 10:10:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:04,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:04,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:04,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:04,929 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-20 10:10:04,930 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:04,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:04,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:04,936 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:04,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:04,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:04,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:04,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:04,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:04,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:04,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:05,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:05,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:05,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:05,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:05,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:05,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:05,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:05,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:05,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:05,398 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,432 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,452 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,466 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,479 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,490 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:05,540 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:05,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:05,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:05,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:05,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,749 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:05,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:10:05,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:05,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:10:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:05,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:05,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:05,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:05,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:05,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:05,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:05,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:05,873 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-20 10:10:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:06,359 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-20 10:10:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:06,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:06,361 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:10:06,362 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:10:06,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:10:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-20 10:10:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:10:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-20 10:10:06,372 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-20 10:10:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:06,372 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-20 10:10:06,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-20 10:10:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:06,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:06,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:06,373 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-20 10:10:06,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:06,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:06,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:06,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:06,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:06,515 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:06,515 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-20 10:10:06,516 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:06,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:06,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:06,522 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:06,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:06,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:06,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:06,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:06,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:06,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:06,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:06,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:06,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:06,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:06,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,712 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:06,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:06,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:06,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:06,956 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,970 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,985 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,001 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:07,033 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:07,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:07,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,100 INFO L267 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-01-20 10:10:07,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:07,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:07,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:10:07,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:07,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-20 10:10:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:07,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:07,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:07,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:07,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:07,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:07,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:07,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:07,221 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-20 10:10:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:07,623 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-20 10:10:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:07,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:07,624 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:10:07,624 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:10:07,625 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-01-20 10:10:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:10:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-20 10:10:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:10:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-20 10:10:07,633 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-20 10:10:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:07,633 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-20 10:10:07,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-20 10:10:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:07,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:07,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:07,634 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:07,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-20 10:10:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:07,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:07,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:07,705 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-20 10:10:07,706 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:07,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:07,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:07,711 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:07,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:07,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:07,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:07,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:07,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:07,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:07,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:07,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:07,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:07,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:07,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:07,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:08,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:08,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:08,021 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,423 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,505 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,521 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,533 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,545 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:08,581 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:08,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:08,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,659 INFO L267 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-01-20 10:10:08,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:08,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:10:08,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:08,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:08,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:08,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:08,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:08,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:08,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:08,807 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-20 10:10:08,983 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-20 10:10:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:09,383 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-20 10:10:09,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:09,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:09,386 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:10:09,386 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:10:09,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:10:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-20 10:10:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:10:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-20 10:10:09,395 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-20 10:10:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:09,395 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-20 10:10:09,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-20 10:10:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:09,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:09,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:09,397 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:09,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-20 10:10:09,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:09,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:09,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:09,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:09,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:09,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:09,476 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-20 10:10:09,478 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:09,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:09,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:09,482 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:09,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:09,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:09,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:09,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:09,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:09,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:09,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:09,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:09,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:09,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:09,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:09,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:09,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:09,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:09,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:09,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:09,741 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,765 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,812 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,822 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:09,854 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:09,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:09,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,950 INFO L267 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-01-20 10:10:09,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:10:09,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:10,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:10:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:10,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:10,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:10,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:10,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:10,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:10,062 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-20 10:10:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:10,438 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-20 10:10:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:10,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:10,440 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:10:10,440 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:10:10,441 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-01-20 10:10:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:10:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-20 10:10:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:10:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-20 10:10:10,451 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-20 10:10:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:10,451 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-20 10:10:10,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-20 10:10:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:10,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:10,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:10,453 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-20 10:10:10,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:10,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:10,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:10,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:10,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:10,491 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:10,491 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-20 10:10:10,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:10,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:10,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:10,500 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:10,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:10,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:10,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:10,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:10,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:10,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:10,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:10,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:10,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:10,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:10,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:10,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:10,603 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,630 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:10,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:10,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:10,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:10,842 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,863 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,878 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,894 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:10,927 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:11,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:11,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:11,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:11,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:11,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:11,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:11,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:11,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:11,102 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-20 10:10:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:11,300 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-20 10:10:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:11,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:10:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:11,301 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:10:11,301 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:10:11,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:10:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:10:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-20 10:10:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 10:10:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-20 10:10:11,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-20 10:10:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:11,312 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-20 10:10:11,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-20 10:10:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:11,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:11,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:11,313 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-20 10:10:11,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:11,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:11,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:11,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:11,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:11,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:11,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:11,415 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-20 10:10:11,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:11,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:11,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:11,421 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:11,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:11,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:11,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:11,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:11,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:11,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:11,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:11,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:11,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:11,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:12,400 WARN L181 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-20 10:10:12,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:12,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:12,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:12,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:12,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:12,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:12,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:12,670 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,721 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,742 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,757 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,783 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:12,829 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:12,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:12,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:12,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:12,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:10:13,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:13,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-20 10:10:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:13,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:13,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:13,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:13,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:13,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:13,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:13,116 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-20 10:10:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:13,583 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-20 10:10:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:13,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:13,586 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:10:13,586 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:10:13,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:10:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-20 10:10:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:10:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-20 10:10:13,602 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-20 10:10:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:13,602 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-20 10:10:13,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-20 10:10:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:13,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:13,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:13,604 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:13,604 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-20 10:10:13,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:13,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:13,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:13,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:13,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:13,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:13,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:13,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:13,676 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-20 10:10:13,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:13,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:13,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:13,681 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:13,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:13,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:13,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:13,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:13,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:13,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:13,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:13,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:13,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:13,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:13,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:13,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:13,828 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,861 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:14,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:14,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:14,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:14,139 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,155 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,171 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,186 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:14,218 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:14,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:14,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,292 INFO L267 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-01-20 10:10:14,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:14,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:10:14,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:14,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:10:14,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-01-20 10:10:14,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:14,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:14,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:14,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:14,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:14,495 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-20 10:10:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:14,950 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-20 10:10:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:14,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:14,952 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:10:14,952 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:10:14,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:10:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-20 10:10:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 10:10:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-20 10:10:14,967 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-20 10:10:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:14,967 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-20 10:10:14,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-20 10:10:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:14,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:14,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:14,968 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-20 10:10:14,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:14,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:14,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:15,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:15,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:15,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:15,036 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-20 10:10:15,038 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:15,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:15,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:15,042 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:15,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:15,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:15,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:15,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:15,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:15,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:15,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:15,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:15,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:15,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:15,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:15,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:15,133 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,171 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:15,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:15,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:15,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:15,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:15,492 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,518 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,544 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,570 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,597 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:15,645 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:15,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:15,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:15,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,847 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:15,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:10:15,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:15,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:10:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:15,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:15,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:15,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:15,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:15,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:15,965 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-20 10:10:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:16,716 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-20 10:10:16,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:16,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:16,717 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:10:16,718 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:10:16,718 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-01-20 10:10:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:10:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-20 10:10:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:10:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-20 10:10:16,729 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-20 10:10:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:16,730 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-20 10:10:16,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-20 10:10:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:16,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:16,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:16,732 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-20 10:10:16,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:16,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:16,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:16,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:16,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:16,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:16,795 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-20 10:10:16,795 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:16,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:16,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:16,800 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:16,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:16,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:16,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:16,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:16,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:16,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:16,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:16,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:10:16,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:10:16,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,854 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:10:16,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:10:16,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:10:16,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,931 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:17,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:17,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,093 INFO L478 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 32 treesize of output 57 [2019-01-20 10:10:17,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:17,140 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,155 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,170 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,184 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:17,216 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-20 10:10:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:17,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:17,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:17,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-20 10:10:17,579 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-01-20 10:10:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:17,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:17,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:10:17,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:10:17,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:17,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:17,604 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-20 10:10:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:17,668 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-20 10:10:17,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:10:17,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:10:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:17,670 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:10:17,670 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:10:17,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:10:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-20 10:10:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:10:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-20 10:10:17,688 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-20 10:10:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:17,688 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-20 10:10:17,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-20 10:10:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:17,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:17,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:17,690 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-20 10:10:17,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:17,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:17,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:17,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:17,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:17,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:17,840 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-20 10:10:17,841 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:17,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:17,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:17,845 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:17,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:17,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:17,846 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-01-20 10:10:17,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:17,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:17,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:17,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:17,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:17,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:18,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:18,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:18,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:18,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:18,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:18,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:18,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:18,145 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,169 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,190 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,205 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,219 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,231 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:18,265 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:18,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:18,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,472 INFO L267 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-01-20 10:10:18,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:18,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:10:18,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:18,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:18,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:18,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:18,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:18,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:18,594 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-20 10:10:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:18,980 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-20 10:10:18,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:18,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:18,983 INFO L225 Difference]: With dead ends: 121 [2019-01-20 10:10:18,984 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:10:18,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:10:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-20 10:10:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:10:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-20 10:10:19,005 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-20 10:10:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:19,006 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-20 10:10:19,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-20 10:10:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:19,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:19,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:19,007 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-20 10:10:19,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:19,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:19,143 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:19,143 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-20 10:10:19,144 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:19,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:19,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:19,147 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:19,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:19,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:19,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,148 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-01-20 10:10:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:19,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:19,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:19,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:19,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:10:19,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:10:19,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,200 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:10:19,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:10:19,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:10:19,226 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,254 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:19,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,388 INFO L478 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 32 treesize of output 57 [2019-01-20 10:10:19,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:19,443 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,456 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,471 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,487 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:19,518 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:10:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:10:19,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:19,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:10:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:19,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:19,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:19,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:19,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:19,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:19,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:19,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:19,697 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-20 10:10:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:19,926 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-20 10:10:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:19,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:10:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:19,928 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:10:19,929 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:10:19,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:10:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:10:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-20 10:10:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:10:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-20 10:10:19,941 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-20 10:10:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:19,941 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-20 10:10:19,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-20 10:10:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:19,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:19,942 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:10:19,942 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-20 10:10:19,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:20,196 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-01-20 10:10:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:20,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:20,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:20,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:20,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:20,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:20,304 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-01-20 10:10:20,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:10:20,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:10:20,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:10:20,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:20,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:20,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:20,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:20,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:20,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:20,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:20,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:20,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,504 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:20,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:20,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:20,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:20,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:20,881 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,906 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,932 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,958 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,984 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:21,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:21,031 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:21,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:21,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:21,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:21,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2019-01-20 10:10:21,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:21,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:21,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-20 10:10:21,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:10:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:21,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:21,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-20 10:10:21,476 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-20 10:10:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:21,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:22,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:22,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:10:22,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:22,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:22,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:22,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:22,068 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-20 10:10:23,030 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-20 10:10:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:23,917 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-20 10:10:23,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:23,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:23,920 INFO L225 Difference]: With dead ends: 133 [2019-01-20 10:10:23,921 INFO L226 Difference]: Without dead ends: 128 [2019-01-20 10:10:23,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-20 10:10:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-20 10:10:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:10:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-20 10:10:23,938 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-20 10:10:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:23,938 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-20 10:10:23,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-20 10:10:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:23,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:23,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:23,939 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-20 10:10:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:23,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:23,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:24,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:24,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:24,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:24,089 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-20 10:10:24,090 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:24,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:24,093 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:24,094 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:24,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:24,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:24,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:24,094 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-01-20 10:10:24,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:24,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:24,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:24,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:24,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:24,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:24,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:24,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:24,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:24,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,252 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,275 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:24,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:24,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:24,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:24,471 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,485 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,501 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:24,549 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:24,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:24,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,635 INFO L267 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-01-20 10:10:24,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:24,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:10:24,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:24,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:24,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:24,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:24,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:24,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:24,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:24,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:24,803 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-20 10:10:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:25,149 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-20 10:10:25,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:25,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:10:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:25,152 INFO L225 Difference]: With dead ends: 125 [2019-01-20 10:10:25,152 INFO L226 Difference]: Without dead ends: 124 [2019-01-20 10:10:25,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-20 10:10:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-20 10:10:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-20 10:10:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-20 10:10:25,169 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-20 10:10:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:25,169 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-20 10:10:25,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-20 10:10:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:25,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:25,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:25,170 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-20 10:10:25,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:25,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:25,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:25,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:25,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:25,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:25,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:25,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:25,328 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-20 10:10:25,329 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:25,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:25,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:25,332 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:25,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:25,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:25,333 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-01-20 10:10:25,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:25,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:25,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:25,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:25,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:25,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:25,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:25,597 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:25,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:25,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:25,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:25,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:25,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:25,775 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,808 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,828 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,844 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,859 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,870 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:25,915 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:25,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:25,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,992 INFO L267 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-01-20 10:10:25,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:26,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-20 10:10:26,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:26,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:26,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:10:26,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,120 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:26,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:26,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:10:26,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:26,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:26,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:10:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:26,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:26,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:26,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:26,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:26,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:26,273 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-20 10:10:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:28,085 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-20 10:10:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:28,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:28,088 INFO L225 Difference]: With dead ends: 149 [2019-01-20 10:10:28,088 INFO L226 Difference]: Without dead ends: 145 [2019-01-20 10:10:28,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:10:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-20 10:10:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-20 10:10:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:10:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-20 10:10:28,110 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-20 10:10:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:28,110 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-20 10:10:28,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-20 10:10:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:28,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:28,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:28,111 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-20 10:10:28,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:28,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:28,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:28,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:28,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:28,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:28,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:28,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:28,273 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-20 10:10:28,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:28,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:28,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:28,278 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:28,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:28,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:28,279 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-01-20 10:10:28,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:28,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:28,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:28,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:28,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:28,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:28,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:28,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:28,354 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,383 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:28,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:28,606 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,621 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,638 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,654 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:28,689 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:28,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:28,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:28,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:28,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:10:28,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,846 INFO L267 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-01-20 10:10:28,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:28,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:28,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:28,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:10:28,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:28,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:28,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:10:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:28,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:28,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:28,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:28,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:28,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:28,995 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-20 10:10:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:29,549 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-20 10:10:29,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:29,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:29,551 INFO L225 Difference]: With dead ends: 138 [2019-01-20 10:10:29,552 INFO L226 Difference]: Without dead ends: 136 [2019-01-20 10:10:29,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-20 10:10:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-20 10:10:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:10:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-20 10:10:29,573 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-20 10:10:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:29,573 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-20 10:10:29,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-20 10:10:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:29,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:29,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:29,575 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-20 10:10:29,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:29,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:29,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:29,702 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-20 10:10:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:29,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:29,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:29,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:29,723 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-20 10:10:29,723 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:29,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:29,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:29,729 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:29,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:29,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:29,730 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-01-20 10:10:29,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:29,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:29,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:29,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:29,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:29,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:29,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:29,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:30,008 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,046 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:30,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:30,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:30,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:30,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:30,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:30,179 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,215 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,236 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,252 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,265 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,278 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:30,323 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:30,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:30,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:30,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:30,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,465 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:30,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:10:30,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:30,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:10:30,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:10:30,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:30,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-20 10:10:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:30,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:30,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:30,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:10:30,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:30,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:30,692 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-20 10:10:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:31,269 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-20 10:10:31,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:31,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:31,273 INFO L225 Difference]: With dead ends: 152 [2019-01-20 10:10:31,273 INFO L226 Difference]: Without dead ends: 151 [2019-01-20 10:10:31,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:10:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-20 10:10:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-20 10:10:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-20 10:10:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-20 10:10:31,294 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-20 10:10:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:31,295 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-20 10:10:31,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-20 10:10:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:31,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:31,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:31,296 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-20 10:10:31,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:31,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:31,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:31,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:31,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:31,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:31,430 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-20 10:10:31,431 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:31,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:31,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:31,434 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:31,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:31,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:31,435 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-01-20 10:10:31,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:31,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:31,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:31,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:31,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:31,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:31,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:31,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:31,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,871 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:32,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:32,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:32,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:32,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:32,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:32,035 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,087 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,120 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,143 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,164 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:32,238 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:32,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:32,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,349 INFO L267 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-01-20 10:10:32,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:32,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,392 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:32,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:10:32,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:32,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-20 10:10:32,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:32,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-20 10:10:32,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:32,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-20 10:10:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:34,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:34,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:34,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:34,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:34,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:34,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:34,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:34,271 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-20 10:10:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:35,048 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-20 10:10:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:35,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:35,050 INFO L225 Difference]: With dead ends: 141 [2019-01-20 10:10:35,050 INFO L226 Difference]: Without dead ends: 140 [2019-01-20 10:10:35,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-20 10:10:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-20 10:10:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:10:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-20 10:10:35,074 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-20 10:10:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:35,075 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-20 10:10:35,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-20 10:10:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:35,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:35,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:35,076 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-20 10:10:35,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:35,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:35,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:35,454 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-20 10:10:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:35,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:35,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:35,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:35,781 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-20 10:10:35,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:35,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:35,786 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:35,786 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:35,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:35,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:35,790 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-01-20 10:10:35,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:35,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:35,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:35,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:35,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:35,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:35,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:35,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:35,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:35,877 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:36,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:36,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:36,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:36,155 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,173 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,187 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:36,238 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:36,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:36,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,303 INFO L267 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-01-20 10:10:36,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:36,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,329 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:36,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:10:36,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:36,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-20 10:10:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-20 10:10:36,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:36,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:10:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:36,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:36,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:36,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:10:36,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:36,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:36,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:36,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:36,496 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-20 10:10:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:37,187 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-20 10:10:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:37,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:37,189 INFO L225 Difference]: With dead ends: 163 [2019-01-20 10:10:37,189 INFO L226 Difference]: Without dead ends: 162 [2019-01-20 10:10:37,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:10:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-20 10:10:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-20 10:10:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-20 10:10:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-20 10:10:37,213 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-20 10:10:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:37,213 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-20 10:10:37,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-20 10:10:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:37,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:37,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:37,214 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-20 10:10:37,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:37,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:37,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:37,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:37,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:37,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:37,305 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:37,305 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-20 10:10:37,306 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:37,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:37,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:37,309 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:37,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:37,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:37,309 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-01-20 10:10:37,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:37,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:37,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:37,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:37,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:37,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:37,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:37,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:37,600 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,627 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:37,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:37,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:37,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:37,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:37,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:37,759 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,796 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,817 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,832 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,858 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:37,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:37,915 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:37,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:37,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:37,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:38,015 INFO L267 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-01-20 10:10:38,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:38,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:10:38,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:38,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:38,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:10:38,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,145 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:38,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:10:38,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:38,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:38,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:10:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:38,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:38,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:38,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:38,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:38,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:38,279 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-20 10:10:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:38,980 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-20 10:10:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:38,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:38,983 INFO L225 Difference]: With dead ends: 163 [2019-01-20 10:10:38,983 INFO L226 Difference]: Without dead ends: 160 [2019-01-20 10:10:38,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-20 10:10:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-20 10:10:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-20 10:10:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-20 10:10:39,004 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-20 10:10:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:39,004 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-20 10:10:39,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-20 10:10:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:39,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:39,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:39,005 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-20 10:10:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:39,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:39,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:39,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:39,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:39,141 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-20 10:10:39,142 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:39,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:39,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:39,145 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:39,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:39,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:39,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:39,146 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-01-20 10:10:39,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:39,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:39,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:39,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:39,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:39,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:39,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:39,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:39,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:39,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:39,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:39,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:39,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:39,400 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,425 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,446 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,462 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,475 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,487 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:39,521 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:39,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:39,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:39,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:39,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:10:39,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,671 INFO L267 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-01-20 10:10:39,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:39,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,740 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:39,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:10:39,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:39,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:10:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:39,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:39,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:39,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:39,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:39,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:39,853 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-20 10:10:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:40,398 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-20 10:10:40,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:40,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:40,401 INFO L225 Difference]: With dead ends: 165 [2019-01-20 10:10:40,401 INFO L226 Difference]: Without dead ends: 163 [2019-01-20 10:10:40,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-20 10:10:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-20 10:10:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-20 10:10:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-20 10:10:40,428 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-20 10:10:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:40,428 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-20 10:10:40,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-20 10:10:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:40,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:40,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:40,429 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-20 10:10:40,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:40,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:40,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:40,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:40,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:40,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:40,480 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-20 10:10:40,481 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:40,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:40,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:40,483 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:40,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:40,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:40,484 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-01-20 10:10:40,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:40,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:40,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:40,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:40,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:40,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:40,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:40,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:40,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:40,575 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:40,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:40,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:40,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:40,840 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,855 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,871 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,886 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:40,918 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:41,384 WARN L181 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-20 10:10:41,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:41,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:41,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:41,421 INFO L267 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-01-20 10:10:41,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:41,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:41,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:41,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:41,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:41,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:41,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:41,446 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:41,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:10:41,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:41,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:41,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-20 10:10:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:41,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:41,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:41,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:10:41,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:41,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:10:41,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:10:41,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:41,535 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-20 10:10:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:41,834 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-20 10:10:41,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:41,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-20 10:10:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:41,837 INFO L225 Difference]: With dead ends: 158 [2019-01-20 10:10:41,838 INFO L226 Difference]: Without dead ends: 156 [2019-01-20 10:10:41,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-20 10:10:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-20 10:10:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-20 10:10:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-20 10:10:41,865 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-20 10:10:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:41,866 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-20 10:10:41,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:10:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-20 10:10:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:41,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:41,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:41,867 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:41,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:41,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-20 10:10:41,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:41,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:41,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:42,221 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-20 10:10:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:42,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:42,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:42,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:42,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:42,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:42,247 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-01-20 10:10:42,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:10:42,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:10:42,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:10:42,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:42,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:42,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:42,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:42,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:42,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:42,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:42,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:42,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:42,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:42,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:42,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:42,733 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,769 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,790 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,807 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,820 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:42,878 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:42,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:42,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,949 INFO L267 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-01-20 10:10:42,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:42,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:10:42,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:43,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:43,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-20 10:10:43,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,076 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:43,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:10:43,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:43,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:43,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:10:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:43,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:43,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:43,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-20 10:10:43,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:43,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:43,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:43,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:43,196 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-20 10:10:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:43,924 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-20 10:10:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:10:43,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:43,928 INFO L225 Difference]: With dead ends: 241 [2019-01-20 10:10:43,928 INFO L226 Difference]: Without dead ends: 235 [2019-01-20 10:10:43,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:10:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-20 10:10:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-20 10:10:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-20 10:10:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-20 10:10:43,977 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-20 10:10:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:43,977 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-20 10:10:43,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-20 10:10:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:43,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:43,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:43,978 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-20 10:10:43,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:43,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:43,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:43,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:44,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:44,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:44,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:44,364 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-20 10:10:44,365 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:44,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:44,367 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:44,367 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:44,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:44,368 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-01-20 10:10:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:44,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:44,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:44,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:44,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:44,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:44,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:44,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:44,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:44,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:44,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:44,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:44,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:44,711 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,727 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,744 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,762 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:44,796 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:45,038 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-20 10:10:45,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,199 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-20 10:10:45,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:10:45,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:45,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:45,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-20 10:10:45,534 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-20 10:10:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,544 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:45,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-20 10:10:45,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-20 10:10:45,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-20 10:10:46,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:10:46,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-20 10:10:46,244 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-20 10:10:46,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-01-20 10:10:46,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:46,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:46,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:46,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:46,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:46,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:46,351 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-20 10:10:46,864 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-20 10:10:47,435 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-20 10:10:47,740 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-01-20 10:10:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:48,039 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-20 10:10:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:48,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:10:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:48,043 INFO L225 Difference]: With dead ends: 208 [2019-01-20 10:10:48,043 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:10:48,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:10:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-20 10:10:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-20 10:10:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-20 10:10:48,077 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-20 10:10:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:48,077 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-20 10:10:48,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-20 10:10:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:48,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:48,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:48,078 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-20 10:10:48,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:48,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:48,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:48,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:48,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:48,260 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-20 10:10:48,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:48,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:48,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:48,264 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:48,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:48,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:48,265 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-01-20 10:10:48,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:48,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:48,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:48,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:48,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:48,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:48,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:48,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:48,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:48,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:48,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:48,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:48,527 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,552 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,573 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,590 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,604 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,616 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:48,650 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:48,913 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-20 10:10:48,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:10:48,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:49,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:49,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-20 10:10:49,341 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-20 10:10:49,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 103 [2019-01-20 10:10:49,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:49,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-01-20 10:10:49,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:49,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-20 10:10:49,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-20 10:10:49,881 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-20 10:10:49,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,945 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:49,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 118 [2019-01-20 10:10:49,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:10:50,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,300 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:50,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-20 10:10:50,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-01-20 10:10:50,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:10:50,639 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-20 10:10:50,780 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 84 [2019-01-20 10:10:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:50,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:50,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:50,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:10:50,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:50,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:50,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:50,845 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-20 10:10:51,775 WARN L181 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-20 10:10:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:52,396 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-20 10:10:52,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:10:52,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:52,401 INFO L225 Difference]: With dead ends: 280 [2019-01-20 10:10:52,401 INFO L226 Difference]: Without dead ends: 279 [2019-01-20 10:10:52,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:10:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-20 10:10:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-20 10:10:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 10:10:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-20 10:10:52,448 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-20 10:10:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:52,448 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-20 10:10:52,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-20 10:10:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:52,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:52,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:52,451 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-20 10:10:52,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:52,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:52,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:52,824 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-20 10:10:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:52,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:52,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:10:52,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:52,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:52,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:52,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:10:52,826 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-20 10:10:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:52,986 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-20 10:10:52,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:10:52,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:10:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:52,989 INFO L225 Difference]: With dead ends: 201 [2019-01-20 10:10:52,989 INFO L226 Difference]: Without dead ends: 198 [2019-01-20 10:10:52,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:10:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-20 10:10:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-20 10:10:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-20 10:10:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-20 10:10:53,033 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-20 10:10:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:53,034 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-20 10:10:53,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-20 10:10:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:53,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:53,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:53,035 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-20 10:10:53,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:53,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:53,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:53,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:53,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:53,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:53,152 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-20 10:10:53,153 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:53,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:53,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:53,155 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:53,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:53,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:53,155 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-01-20 10:10:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:53,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:53,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:53,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:53,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:53,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:53,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:53,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:53,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:53,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:53,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:53,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:53,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:10:53,468 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,494 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,515 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,531 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,545 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,555 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:53,588 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:10:53,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:53,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,663 INFO L267 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-01-20 10:10:53,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:53,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:53,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:10:53,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:53,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-20 10:10:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:53,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:53,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:53,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:53,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:53,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:53,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:53,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:53,790 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-20 10:10:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:54,118 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-20 10:10:54,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:54,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:10:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:54,122 INFO L225 Difference]: With dead ends: 208 [2019-01-20 10:10:54,122 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:10:54,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-01-20 10:10:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:10:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-20 10:10:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-20 10:10:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-20 10:10:54,156 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-20 10:10:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:54,156 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-20 10:10:54,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-20 10:10:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:54,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:54,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:54,158 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:54,158 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-20 10:10:54,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:54,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:54,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:54,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:54,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:54,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:54,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:54,250 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:54,251 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-20 10:10:54,251 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:54,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:54,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:54,254 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:54,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:54,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:54,254 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-01-20 10:10:54,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:54,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:54,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:54,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:54,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:54,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,332 INFO L478 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 32 treesize of output 57 [2019-01-20 10:10:54,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:54,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,488 INFO L478 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 21 treesize of output 24 [2019-01-20 10:10:54,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:10:54,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:10:54,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:10:54,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:10:54,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:10:54,550 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,575 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,592 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,607 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,631 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:54,663 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:10:54,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:10:54,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,733 INFO L267 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-01-20 10:10:54,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:10:54,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:54,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-20 10:10:54,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:54,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:54,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-20 10:10:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:54,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:54,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:54,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:54,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:54,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:54,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:54,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:54,853 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-20 10:10:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:55,171 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-20 10:10:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:55,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:10:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:55,175 INFO L225 Difference]: With dead ends: 210 [2019-01-20 10:10:55,175 INFO L226 Difference]: Without dead ends: 208 [2019-01-20 10:10:55,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-20 10:10:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-20 10:10:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-20 10:10:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-20 10:10:55,213 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-20 10:10:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:55,213 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-20 10:10:55,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-20 10:10:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:55,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:55,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:55,215 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:55,215 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-20 10:10:55,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:55,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:55,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:55,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:55,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:55,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:55,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:55,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:55,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:55,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:55,327 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-01-20 10:10:55,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:10:55,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:10:55,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:10:55,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:55,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:55,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:55,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:55,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:55,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:55,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:55,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:55,601 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:55,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:55,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:55,695 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:55,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:55,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:55,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:55,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:55,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:55,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:55,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:55,789 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,122 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,143 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,172 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,183 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:56,231 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:56,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:56,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,328 INFO L267 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-01-20 10:10:56,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:56,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:10:56,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:56,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-20 10:10:56,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:56,480 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:56,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-20 10:10:56,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:56,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:56,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:10:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:56,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:56,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:56,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:56,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:56,631 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-20 10:10:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:58,299 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-20 10:10:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:58,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:10:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:58,303 INFO L225 Difference]: With dead ends: 242 [2019-01-20 10:10:58,303 INFO L226 Difference]: Without dead ends: 240 [2019-01-20 10:10:58,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-20 10:10:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-20 10:10:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-20 10:10:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-20 10:10:58,349 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-20 10:10:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:58,349 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-20 10:10:58,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-20 10:10:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:58,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:58,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:58,351 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-20 10:10:58,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:58,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:58,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:58,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:58,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:58,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:58,502 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-20 10:10:58,503 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:58,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:58,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:58,506 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:58,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:58,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:58,507 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-01-20 10:10:58,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:58,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:58,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:58,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:10:58,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:10:58,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:58,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:10:58,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:10:58,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:10:58,600 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:58,644 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:58,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:58,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:58,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:58,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:58,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:58,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:58,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:58,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:58,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:58,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:58,977 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,004 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,031 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,092 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,118 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:59,167 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:10:59,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:59,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,252 INFO L267 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-01-20 10:10:59,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:59,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:10:59,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:59,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-20 10:10:59,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:59,392 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:59,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-20 10:10:59,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:59,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:59,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:10:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:59,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:59,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:59,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:59,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:59,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:59,529 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-20 10:11:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:00,174 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-20 10:11:00,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:00,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:00,177 INFO L225 Difference]: With dead ends: 249 [2019-01-20 10:11:00,177 INFO L226 Difference]: Without dead ends: 247 [2019-01-20 10:11:00,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-20 10:11:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-20 10:11:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-20 10:11:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-20 10:11:00,209 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-20 10:11:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:00,210 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-20 10:11:00,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-20 10:11:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:00,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:00,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:00,211 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-20 10:11:00,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:00,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:00,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:00,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:00,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:00,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:00,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:00,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:00,316 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-20 10:11:00,318 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:00,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:00,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:00,321 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:00,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:00,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:00,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:00,322 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-01-20 10:11:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:00,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:00,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:00,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:00,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:00,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:00,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:00,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:00,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:11:00,417 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,444 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:11:00,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:11:00,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:11:00,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:00,694 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,710 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,725 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,740 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:00,771 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:11:00,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:11:00,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:00,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:11:00,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:11:00,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:00,920 INFO L267 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-01-20 10:11:00,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:11:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:00,954 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:00,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:11:00,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:01,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:01,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:11:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:01,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:01,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:01,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:01,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:01,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:01,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:01,083 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-20 10:11:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:03,623 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-20 10:11:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:03,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:03,626 INFO L225 Difference]: With dead ends: 260 [2019-01-20 10:11:03,626 INFO L226 Difference]: Without dead ends: 258 [2019-01-20 10:11:03,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=109, Invalid=196, Unknown=1, NotChecked=0, Total=306 [2019-01-20 10:11:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-20 10:11:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-20 10:11:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:11:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-20 10:11:03,671 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-20 10:11:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:03,672 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-20 10:11:03,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-20 10:11:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:03,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:03,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:03,673 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-20 10:11:03,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:03,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:03,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:03,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:03,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:03,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:03,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:03,834 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-20 10:11:03,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:03,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:03,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:03,837 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:03,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:03,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:03,838 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-01-20 10:11:03,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:03,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:03,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:03,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:03,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:03,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:03,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,906 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:03,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:03,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:03,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:11:03,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:03,988 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,009 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:11:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:11:04,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,140 INFO L478 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 46 treesize of output 68 [2019-01-20 10:11:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:11:04,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:04,258 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,281 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,304 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,327 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,352 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:04,395 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:11:04,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:11:04,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:04,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:11:04,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,494 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:04,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 101 [2019-01-20 10:11:04,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:04,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-20 10:11:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:04,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:04,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:04,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:04,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:04,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:04,594 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-20 10:11:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:04,902 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-20 10:11:04,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:11:04,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:11:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:04,905 INFO L225 Difference]: With dead ends: 244 [2019-01-20 10:11:04,905 INFO L226 Difference]: Without dead ends: 243 [2019-01-20 10:11:04,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-01-20 10:11:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-20 10:11:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-20 10:11:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:11:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-20 10:11:04,940 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-20 10:11:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:04,940 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-20 10:11:04,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-20 10:11:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:04,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:04,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:04,942 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:04,942 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-20 10:11:04,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:04,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:04,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:04,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:04,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:05,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:05,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:05,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:05,111 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-20 10:11:05,112 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:05,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:05,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:05,114 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:05,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:05,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:05,115 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-01-20 10:11:05,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:05,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:05,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:05,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:05,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:05,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:05,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,166 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:05,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:05,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:11:05,192 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,231 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:05,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:05,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,365 INFO L478 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 32 treesize of output 57 [2019-01-20 10:11:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:05,410 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,425 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,438 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,453 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:05,483 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:11:05,673 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-20 10:11:05,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:11:05,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-20 10:11:06,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-20 10:11:06,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:425 [2019-01-20 10:11:10,413 WARN L181 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 207 DAG size of output: 90 [2019-01-20 10:11:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,422 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:10,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 88 [2019-01-20 10:11:10,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:10,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 92 [2019-01-20 10:11:10,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:10,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-20 10:11:10,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:10,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-20 10:11:10,698 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:194, output treesize:126 [2019-01-20 10:11:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:10,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:10,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:10,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:10,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:10,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:10,831 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-20 10:11:11,223 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-20 10:11:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:20,083 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-20 10:11:20,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:11:20,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:11:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:20,087 INFO L225 Difference]: With dead ends: 273 [2019-01-20 10:11:20,087 INFO L226 Difference]: Without dead ends: 272 [2019-01-20 10:11:20,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:11:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-20 10:11:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-20 10:11:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-20 10:11:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-20 10:11:20,122 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-20 10:11:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:20,123 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-20 10:11:20,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-20 10:11:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:20,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:20,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:20,123 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-20 10:11:20,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:20,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:20,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:20,267 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-01-20 10:11:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:20,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:20,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:20,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:20,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:11:20,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:20,284 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-01-20 10:11:20,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:11:20,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:11:20,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:11:20,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:11:20,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:20,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:20,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:20,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:20,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:20,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:20,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:20,372 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:20,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:20,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:20,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:20,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:20,721 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,746 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,770 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,795 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,820 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:20,865 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:11:20,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:20,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:20,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,978 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:20,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:11:20,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:21,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:11:21,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:11:21,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:21,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-20 10:11:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:21,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:21,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:21,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:11:21,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:21,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:21,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:21,173 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-20 10:11:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:21,881 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-20 10:11:21,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:11:21,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:21,885 INFO L225 Difference]: With dead ends: 274 [2019-01-20 10:11:21,885 INFO L226 Difference]: Without dead ends: 273 [2019-01-20 10:11:21,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-20 10:11:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-20 10:11:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:11:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-20 10:11:21,927 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-20 10:11:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:21,928 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-20 10:11:21,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-20 10:11:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:21,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:21,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:21,929 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-20 10:11:21,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:21,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:11:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:21,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:22,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:22,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:22,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:22,063 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-20 10:11:22,064 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:22,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:22,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:22,067 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:11:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:22,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:22,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:22,068 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-01-20 10:11:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:22,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:22,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:22,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:11:22,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:11:22,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,140 INFO L478 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 46 treesize of output 68 [2019-01-20 10:11:22,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:11:22,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:22,258 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:22,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:22,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:22,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:22,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:22,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:11:22,406 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,438 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,456 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,470 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,481 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:22,534 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-20 10:11:22,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:11:22,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:22,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-20 10:11:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:22,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:22,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:22,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:11:22,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:22,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:11:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:11:22,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:11:22,643 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-20 10:11:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:22,838 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-20 10:11:22,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:11:22,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-20 10:11:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:22,841 INFO L225 Difference]: With dead ends: 242 [2019-01-20 10:11:22,841 INFO L226 Difference]: Without dead ends: 241 [2019-01-20 10:11:22,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:11:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-20 10:11:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-20 10:11:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:11:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-20 10:11:22,877 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-20 10:11:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:22,878 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-20 10:11:22,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:11:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-20 10:11:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:22,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:22,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:22,879 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:22,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-20 10:11:22,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:22,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:22,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:23,138 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-20 10:11:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:23,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:23,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:23,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:23,175 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-20 10:11:23,175 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:23,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:23,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:23,178 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:23,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:23,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:23,178 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-01-20 10:11:23,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:23,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:23,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:23,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:23,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:23,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:23,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:23,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:23,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:23,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:23,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:23,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:23,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:23,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:23,594 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,636 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,656 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,671 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,684 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:23,738 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:23,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:11:23,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,816 INFO L267 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-01-20 10:11:23,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:23,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:11:23,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:23,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:23,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,931 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:23,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 128 [2019-01-20 10:11:23,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:23,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:11:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:24,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:24,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:24,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:24,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:24,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:24,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:24,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:24,064 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-20 10:11:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:24,700 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-20 10:11:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:24,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:24,704 INFO L225 Difference]: With dead ends: 276 [2019-01-20 10:11:24,704 INFO L226 Difference]: Without dead ends: 274 [2019-01-20 10:11:24,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-20 10:11:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-20 10:11:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-20 10:11:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-20 10:11:24,749 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-20 10:11:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:24,750 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-20 10:11:24,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-20 10:11:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:24,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:24,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:24,751 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-20 10:11:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:24,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:24,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:24,923 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-20 10:11:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:24,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:24,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:24,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:24,934 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-20 10:11:24,935 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:24,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:24,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:24,938 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:24,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:24,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:24,939 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-01-20 10:11:24,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:24,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:24,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:24,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:11:25,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:11:25,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:11:25,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:25,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:25,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:25,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:25,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:25,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:25,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:11:25,187 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,232 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,260 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,271 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:25,303 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:11:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:11:25,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,370 INFO L267 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-01-20 10:11:25,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:11:25,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,545 INFO L303 Elim1Store]: Index analysis took 160 ms [2019-01-20 10:11:25,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:11:25,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:25,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:11:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:25,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:25,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:25,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:25,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:25,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:25,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:25,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:25,831 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-20 10:11:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:26,201 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-20 10:11:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:26,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:11:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:26,205 INFO L225 Difference]: With dead ends: 288 [2019-01-20 10:11:26,205 INFO L226 Difference]: Without dead ends: 287 [2019-01-20 10:11:26,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:11:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-20 10:11:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-20 10:11:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-20 10:11:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-20 10:11:26,260 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-20 10:11:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:26,260 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-20 10:11:26,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-20 10:11:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:26,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:26,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:26,261 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-20 10:11:26,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:26,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:26,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:26,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:26,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:26,325 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-20 10:11:26,326 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:26,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:26,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:26,327 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:26,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:26,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:26,328 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-01-20 10:11:26,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:26,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:26,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:26,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:26,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:26,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:26,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,384 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:26,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:26,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:11:26,399 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,426 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,444 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:26,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:26,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,557 INFO L478 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 32 treesize of output 57 [2019-01-20 10:11:26,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:26,602 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,616 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,630 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,645 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:26,674 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:11:26,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:11:26,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:26,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:26,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-20 10:11:26,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:11:26,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,893 INFO L267 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-01-20 10:11:26,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-20 10:11:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:26,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:26,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:26,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:11:26,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:26,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:26,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:11:26,938 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-20 10:11:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:27,317 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-20 10:11:27,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:11:27,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:11:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:27,321 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:11:27,321 INFO L226 Difference]: Without dead ends: 318 [2019-01-20 10:11:27,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-20 10:11:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-20 10:11:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-20 10:11:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-20 10:11:27,370 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-20 10:11:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:27,370 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-20 10:11:27,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-20 10:11:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:27,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:27,371 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:11:27,371 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:27,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-20 10:11:27,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:27,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:27,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:27,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:27,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:27,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:27,553 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-20 10:11:27,553 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:27,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:27,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:27,556 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:11:27,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:27,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:27,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:27,557 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-01-20 10:11:27,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:27,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:27,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:27,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:27,729 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-20 10:11:27,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:27,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,773 INFO L478 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 32 treesize of output 57 [2019-01-20 10:11:27,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:27,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,912 INFO L478 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 21 treesize of output 24 [2019-01-20 10:11:27,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:27,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:27,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:27,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:27,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:11:27,938 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,962 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,980 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,992 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,014 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:28,043 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:11:28,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:11:28,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,126 INFO L267 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-01-20 10:11:28,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:11:28,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-20 10:11:28,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:28,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-20 10:11:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:28,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:28,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:28,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:11:28,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:28,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:11:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:11:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:11:28,234 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-20 10:11:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:28,459 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-20 10:11:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:11:28,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-20 10:11:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:28,463 INFO L225 Difference]: With dead ends: 290 [2019-01-20 10:11:28,463 INFO L226 Difference]: Without dead ends: 289 [2019-01-20 10:11:28,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-20 10:11:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-20 10:11:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-20 10:11:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-20 10:11:28,526 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-20 10:11:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:28,526 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-20 10:11:28,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:11:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-20 10:11:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:28,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:28,527 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-20 10:11:28,527 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-20 10:11:28,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:28,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:28,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:28,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:28,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:28,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:28,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:28,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:11:28,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:28,658 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-01-20 10:11:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:11:28,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:11:28,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:11:28,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:11:28,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:28,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:28,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:28,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:28,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:28,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:28,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:11:28,735 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:28,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:11:28,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:11:28,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:11:28,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:28,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:28,990 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,005 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,020 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,040 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:29,072 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:11:29,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:11:29,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,132 INFO L267 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-01-20 10:11:29,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:11:29,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:11:29,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,197 INFO L267 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-01-20 10:11:29,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:11:29,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:11:29,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,264 INFO L267 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-01-20 10:11:29,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-20 10:11:29,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:11:29,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:29,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:11:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:29,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:29,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:29,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:11:29,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:29,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:11:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:11:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:11:29,402 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-20 10:11:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:29,949 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-20 10:11:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:11:29,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:11:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:29,953 INFO L225 Difference]: With dead ends: 423 [2019-01-20 10:11:29,954 INFO L226 Difference]: Without dead ends: 421 [2019-01-20 10:11:29,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-20 10:11:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-20 10:11:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-20 10:11:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-20 10:11:30,036 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-20 10:11:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:30,036 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-20 10:11:30,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:11:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-20 10:11:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:30,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:30,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:30,038 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:30,038 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-20 10:11:30,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:30,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:30,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:11:30,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:30,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:30,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:30,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:30,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:30,118 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-20 10:11:30,119 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:30,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:30,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:30,121 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:30,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:30,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:30,122 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-01-20 10:11:30,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:30,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:30,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:30,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:30,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:30,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:30,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:30,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:30,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:30,187 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,227 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:30,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:30,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:30,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:30,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:30,566 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,591 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,616 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,640 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:30,710 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:30,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:30,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,795 INFO L267 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-01-20 10:11:30,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:11:30,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:30,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:30,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,916 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:30,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:11:30,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:30,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-20 10:11:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:30,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:31,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:31,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:31,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:31,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:31,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:31,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:31,101 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-20 10:11:31,696 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-20 10:11:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:32,129 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-20 10:11:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:32,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:11:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:32,134 INFO L225 Difference]: With dead ends: 368 [2019-01-20 10:11:32,134 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:11:32,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:11:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-20 10:11:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-20 10:11:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-20 10:11:32,204 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-20 10:11:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:32,204 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-20 10:11:32,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-20 10:11:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:32,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:32,206 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:11:32,206 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-20 10:11:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:32,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:32,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:32,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:32,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:32,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:32,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:11:32,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:32,261 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-01-20 10:11:32,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:11:32,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:11:32,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:11:32,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:11:32,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:32,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:32,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:32,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:32,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:32,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:32,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:32,403 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,442 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,463 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:32,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:32,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:32,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:32,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:32,747 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,772 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,796 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,844 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:32,888 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:32,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:32,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:32,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:11:32,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:33,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:33,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:33,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:33,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:11:33,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:33,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:33,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:11:33,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:33,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2019-01-20 10:11:33,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:33,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:33,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-20 10:11:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:33,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:33,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:11:33,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:33,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:11:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:11:33,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:33,312 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-20 10:11:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:34,080 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-20 10:11:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:11:34,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:11:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:34,085 INFO L225 Difference]: With dead ends: 407 [2019-01-20 10:11:34,085 INFO L226 Difference]: Without dead ends: 401 [2019-01-20 10:11:34,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:11:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-20 10:11:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-20 10:11:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-20 10:11:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-20 10:11:34,160 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-20 10:11:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:34,160 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-20 10:11:34,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:11:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-20 10:11:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:34,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:34,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:34,162 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:34,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-20 10:11:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:34,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:11:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:34,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:34,456 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-20 10:11:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:34,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:34,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:34,604 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:34,605 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-20 10:11:34,606 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:34,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:34,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:34,608 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:11:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:34,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:34,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:34,609 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-01-20 10:11:34,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:34,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:34,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:34,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:34,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:34,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:34,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:34,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:34,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,769 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:34,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:34,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:34,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:35,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:35,075 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,100 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,124 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,149 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,174 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:35,218 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:35,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:35,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,295 INFO L267 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-01-20 10:11:35,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:35,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:11:35,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,380 INFO L267 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-01-20 10:11:35,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:35,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:35,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:11:35,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:35,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:11:35,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,517 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:35,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:11:35,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:35,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:11:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:35,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:35,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:35,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:11:35,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:35,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:11:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:11:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:35,661 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-20 10:11:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:36,676 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-20 10:11:36,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 10:11:36,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:11:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:36,683 INFO L225 Difference]: With dead ends: 645 [2019-01-20 10:11:36,683 INFO L226 Difference]: Without dead ends: 643 [2019-01-20 10:11:36,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:11:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-20 10:11:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-20 10:11:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-20 10:11:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-20 10:11:36,787 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-20 10:11:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:36,787 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-20 10:11:36,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:11:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-20 10:11:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:36,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:36,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:36,788 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-20 10:11:36,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:36,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:36,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:36,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:36,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:36,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:36,874 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-20 10:11:36,877 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:36,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:36,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:36,879 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:36,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:36,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:36,879 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-01-20 10:11:36,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:36,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:36,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:36,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:36,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:36,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:36,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,989 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:36,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:37,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:11:37,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,035 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,055 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:37,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:37,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,169 INFO L478 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 32 treesize of output 57 [2019-01-20 10:11:37,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:37,225 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,237 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,251 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,266 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:37,295 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:11:37,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:11:37,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,360 INFO L267 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-01-20 10:11:37,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:11:37,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:11:37,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:37,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:37,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-20 10:11:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:37,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:37,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:37,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:11:37,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:37,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:11:37,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:11:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:37,653 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-20 10:11:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:38,187 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-20 10:11:38,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:11:38,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:11:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:38,194 INFO L225 Difference]: With dead ends: 527 [2019-01-20 10:11:38,194 INFO L226 Difference]: Without dead ends: 524 [2019-01-20 10:11:38,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:11:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-20 10:11:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-20 10:11:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-20 10:11:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-20 10:11:38,303 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-20 10:11:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:38,304 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-20 10:11:38,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:11:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-20 10:11:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:38,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:38,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:38,305 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-20 10:11:38,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:38,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:38,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:38,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:38,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:38,374 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-20 10:11:38,375 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:38,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:38,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:38,378 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:38,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:38,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:38,378 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-01-20 10:11:38,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:38,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:38,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:38,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:38,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:38,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:38,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:38,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:38,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:11:38,467 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,496 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:11:38,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:11:38,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:11:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:38,702 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,718 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,733 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,748 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:38,780 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:11:38,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:11:38,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:38,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:11:38,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:11:38,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,921 INFO L267 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-01-20 10:11:38,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:11:38,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:38,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-20 10:11:38,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:39,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:39,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:11:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:39,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:39,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:39,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:39,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:39,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:39,079 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-20 10:11:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:39,673 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-20 10:11:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:39,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:11:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:39,680 INFO L225 Difference]: With dead ends: 534 [2019-01-20 10:11:39,680 INFO L226 Difference]: Without dead ends: 533 [2019-01-20 10:11:39,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-20 10:11:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-20 10:11:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-20 10:11:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-20 10:11:39,806 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-20 10:11:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:39,806 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-20 10:11:39,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-20 10:11:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:39,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:39,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:39,808 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-20 10:11:39,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:39,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:39,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:39,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:39,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:39,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:39,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:39,870 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:39,870 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-20 10:11:39,871 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:39,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:39,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:39,873 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:39,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:39,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:39,874 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-01-20 10:11:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:39,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:39,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:39,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:39,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:39,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:39,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,928 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:39,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:39,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:11:39,947 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:39,984 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:11:40,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:11:40,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,130 INFO L478 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 46 treesize of output 68 [2019-01-20 10:11:40,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:11:40,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:40,245 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,267 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,290 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,313 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,338 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:40,379 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:11:40,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:11:40,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,485 INFO L267 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-01-20 10:11:40,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:11:40,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-20 10:11:40,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:40,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-20 10:11:40,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,596 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:40,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:40,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-01-20 10:11:40,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:40,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:40,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-20 10:11:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:40,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:40,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:40,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:40,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:40,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:40,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:40,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:40,741 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-20 10:11:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:41,331 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-20 10:11:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:41,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:11:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:41,337 INFO L225 Difference]: With dead ends: 543 [2019-01-20 10:11:41,338 INFO L226 Difference]: Without dead ends: 542 [2019-01-20 10:11:41,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-20 10:11:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-20 10:11:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-20 10:11:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-20 10:11:41,457 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-20 10:11:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:41,458 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-20 10:11:41,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-20 10:11:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:41,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:41,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:41,460 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-20 10:11:41,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:41,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:41,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:41,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:41,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:41,596 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:41,597 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-20 10:11:41,597 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:41,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:41,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:41,599 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:41,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:41,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:41,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 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-01-20 10:11:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:41,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:41,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:41,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:41,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:41,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:41,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,641 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:41,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:41,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:11:41,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:41,698 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:41,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:41,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:41,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:41,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:41,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:11:41,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:11:41,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,847 INFO L478 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 46 treesize of output 68 [2019-01-20 10:11:41,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:11:41,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:41,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:41,963 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:41,987 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:42,009 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:42,033 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:42,058 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:42,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:42,100 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:11:42,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:11:42,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:42,173 INFO L267 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-01-20 10:11:42,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:11:42,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-20 10:11:42,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:42,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:42,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-20 10:11:42,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:42,299 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:42,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:11:42,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:42,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:42,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-20 10:11:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:42,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:42,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:42,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:42,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:42,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:42,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:42,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:42,424 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-20 10:11:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:43,092 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-20 10:11:43,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:43,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:11:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:43,097 INFO L225 Difference]: With dead ends: 537 [2019-01-20 10:11:43,098 INFO L226 Difference]: Without dead ends: 536 [2019-01-20 10:11:43,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-20 10:11:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-20 10:11:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-20 10:11:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-20 10:11:43,215 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-20 10:11:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:43,215 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-20 10:11:43,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-20 10:11:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:43,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:43,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:43,216 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-20 10:11:43,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:43,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:43,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:43,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:43,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:43,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:43,318 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-20 10:11:43,319 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:43,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:43,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:43,321 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:43,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:43,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:43,322 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-01-20 10:11:43,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:43,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:43,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:43,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:43,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:43,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:43,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:43,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:43,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:43,396 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,434 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:43,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:43,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:43,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:43,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:43,746 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,847 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,872 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,896 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,921 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:43,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:43,965 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:43,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:43,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:43,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,037 INFO L267 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-01-20 10:11:44,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:44,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,073 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:44,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:11:44,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:44,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-20 10:11:44,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:11:44,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:44,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-20 10:11:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:44,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:44,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:44,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:44,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:44,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:44,291 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-20 10:11:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:44,979 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-20 10:11:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:44,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:11:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:44,984 INFO L225 Difference]: With dead ends: 588 [2019-01-20 10:11:44,984 INFO L226 Difference]: Without dead ends: 587 [2019-01-20 10:11:44,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-20 10:11:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-20 10:11:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-20 10:11:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-20 10:11:45,106 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-20 10:11:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:45,107 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-20 10:11:45,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-20 10:11:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:45,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:45,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:45,108 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-20 10:11:45,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:45,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:45,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:45,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:45,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:45,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:45,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:45,158 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:45,158 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-20 10:11:45,159 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:45,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:45,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:45,162 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:45,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:45,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:45,163 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:45,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:45,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:45,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:45,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:45,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:45,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,237 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:45,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:11:45,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:11:45,504 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-20 10:11:45,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:11:45,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,549 INFO L478 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 46 treesize of output 68 [2019-01-20 10:11:45,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:11:45,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:45,667 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,688 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,711 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,734 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,759 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:45,800 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:11:45,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:11:45,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:45,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:11:45,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:45,897 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:45,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-20 10:11:45,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:45,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:45,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-20 10:11:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:45,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:46,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:46,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:46,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:46,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:46,002 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-20 10:11:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:46,471 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-20 10:11:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:11:46,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:11:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:46,475 INFO L225 Difference]: With dead ends: 558 [2019-01-20 10:11:46,475 INFO L226 Difference]: Without dead ends: 557 [2019-01-20 10:11:46,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-20 10:11:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-20 10:11:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-20 10:11:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-20 10:11:46,609 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-20 10:11:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:46,609 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-20 10:11:46,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-20 10:11:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:46,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:46,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:46,611 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-20 10:11:46,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:46,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:46,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:46,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:46,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:46,687 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-20 10:11:46,688 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:46,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:46,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:46,690 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:46,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:46,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:46,691 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:46,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:46,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:46,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:46,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:11:46,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:11:46,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:11:46,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:46,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:46,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:46,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:46,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:46,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:46,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:46,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:46,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:46,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:46,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:46,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:11:46,948 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:46,974 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:46,993 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:47,008 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:47,019 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:47,030 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:47,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:47,061 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:11:47,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:11:47,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:47,123 INFO L267 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-01-20 10:11:47,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:11:47,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:47,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:11:47,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:47,179 INFO L267 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-01-20 10:11:47,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-20 10:11:47,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:47,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-20 10:11:47,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:47,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:47,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:11:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:47,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:47,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:47,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:11:47,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:47,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:47,298 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-20 10:11:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:47,971 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-20 10:11:47,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:11:47,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:11:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:47,976 INFO L225 Difference]: With dead ends: 795 [2019-01-20 10:11:47,976 INFO L226 Difference]: Without dead ends: 794 [2019-01-20 10:11:47,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-20 10:11:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-20 10:11:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-20 10:11:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-20 10:11:48,117 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-20 10:11:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:48,118 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-20 10:11:48,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-20 10:11:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:48,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:48,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:48,119 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-20 10:11:48,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:48,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:48,337 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-20 10:11:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:48,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:48,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:48,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:11:48,377 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-20 10:11:48,377 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:48,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:48,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:48,379 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:48,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:48,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:48,380 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:48,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:48,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:48,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:48,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:48,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:11:48,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:11:48,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,415 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:11:48,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:11:48,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:11:48,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,471 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,489 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:48,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:48,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,602 INFO L478 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 32 treesize of output 57 [2019-01-20 10:11:48,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:48,646 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,661 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,674 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,689 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:48,718 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:11:48,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:11:48,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:48,786 INFO L267 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-01-20 10:11:48,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:11:48,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:48,815 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:48,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:11:48,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:48,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:48,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-20 10:11:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:49,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:49,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:11:49,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:49,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:11:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:11:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:49,060 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-20 10:11:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:49,817 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-20 10:11:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:11:49,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:11:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:49,820 INFO L225 Difference]: With dead ends: 539 [2019-01-20 10:11:49,821 INFO L226 Difference]: Without dead ends: 538 [2019-01-20 10:11:49,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:11:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-20 10:11:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-20 10:11:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-20 10:11:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-20 10:11:50,020 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-20 10:11:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:50,021 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-20 10:11:50,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:11:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-20 10:11:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:50,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:50,022 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:11:50,022 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-20 10:11:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:50,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:50,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:50,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:50,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:50,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:11:50,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:50,107 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:50,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:50,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:50,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:50,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:50,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:50,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:50,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:50,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:50,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:11:50,170 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:11:50,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:11:50,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:11:50,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:50,450 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,466 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,481 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,496 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:50,527 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:11:50,739 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-20 10:11:50,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:11:50,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:50,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:50,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-20 10:11:51,118 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-20 10:11:51,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2019-01-20 10:11:51,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:51,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 91 [2019-01-20 10:11:51,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:51,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:11:51,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-20 10:11:51,559 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-20 10:11:51,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2019-01-20 10:11:51,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:51,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 111 [2019-01-20 10:11:51,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:51,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:51,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:11:51,797 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:51,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-20 10:11:51,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-20 10:11:52,091 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 10:11:52,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 125 [2019-01-20 10:11:52,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:11:52,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:11:52,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:52,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,613 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:52,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:52,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-20 10:11:52,615 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:52,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:11:52,743 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-20 10:11:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:52,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:52,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:52,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:11:52,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:52,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:11:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:11:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:52,957 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-20 10:11:53,164 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-20 10:11:53,784 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-20 10:11:54,234 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-20 10:11:54,738 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-20 10:11:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:55,545 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-20 10:11:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:11:55,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:11:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:55,550 INFO L225 Difference]: With dead ends: 678 [2019-01-20 10:11:55,550 INFO L226 Difference]: Without dead ends: 673 [2019-01-20 10:11:55,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:11:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-20 10:11:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-20 10:11:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-20 10:11:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-20 10:11:55,781 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-20 10:11:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:55,781 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-20 10:11:55,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:11:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-20 10:11:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:55,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:55,782 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:11:55,783 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:55,783 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-20 10:11:55,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:55,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:55,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:55,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:55,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:55,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:55,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:11:55,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:55,938 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:55,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:11:55,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:11:55,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:11:55,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:11:55,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:55,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:55,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:56,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:56,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:56,019 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,059 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:56,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:56,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:56,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:56,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:56,361 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,386 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,411 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,435 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,461 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:56,505 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:56,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:11:56,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,584 INFO L267 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-01-20 10:11:56,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:56,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:11:56,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,658 INFO L267 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-01-20 10:11:56,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:11:56,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:11:56,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:56,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-20 10:11:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 135 [2019-01-20 10:11:56,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:56,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-20 10:11:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:56,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:57,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:57,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:11:57,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:57,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:11:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:11:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:57,035 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-20 10:11:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:57,864 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-20 10:11:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:11:57,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:11:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:57,869 INFO L225 Difference]: With dead ends: 704 [2019-01-20 10:11:57,869 INFO L226 Difference]: Without dead ends: 703 [2019-01-20 10:11:57,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:11:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-20 10:11:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-20 10:11:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-20 10:11:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-20 10:11:58,104 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-20 10:11:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:58,105 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-20 10:11:58,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:11:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-20 10:11:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:11:58,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:58,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:11:58,106 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-20 10:11:58,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:58,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:58,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:11:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:58,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:58,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:58,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:58,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:58,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:11:58,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:58,268 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:58,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:11:58,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:11:58,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:11:58,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:11:58,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:58,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:11:58,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:11:58,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:11:58,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:11:58,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:11:58,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:11:58,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,411 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:58,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:58,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:58,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:58,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:58,694 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,719 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,743 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,768 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,793 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:58,836 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:11:58,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:11:58,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:58,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:58,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:58,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:58,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:11:58,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:59,000 INFO L267 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-01-20 10:11:59,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:11:59,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,043 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:59,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:11:59,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:59,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:59,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:11:59,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,133 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:59,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:59,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:11:59,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:59,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:59,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:11:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:59,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:59,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:11:59,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:59,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:11:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:11:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:59,282 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-20 10:12:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:00,780 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-20 10:12:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:12:00,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:12:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:00,788 INFO L225 Difference]: With dead ends: 1218 [2019-01-20 10:12:00,788 INFO L226 Difference]: Without dead ends: 1217 [2019-01-20 10:12:00,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:12:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-20 10:12:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-20 10:12:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-20 10:12:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-20 10:12:01,154 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-20 10:12:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:01,154 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-20 10:12:01,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-20 10:12:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:01,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:01,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:01,155 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-20 10:12:01,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:01,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:12:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:01,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:01,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:01,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:01,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:01,310 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-20 10:12:01,311 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:01,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:01,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:01,313 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:01,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:01,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:01,313 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:01,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:01,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:01,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:01,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:01,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:01,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:01,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:01,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:01,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:12:01,422 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:12:01,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:12:01,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:12:01,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:12:01,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:12:01,768 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,792 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,816 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,840 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,865 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:01,909 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:12:01,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:01,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:12:01,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:01,984 INFO L267 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-01-20 10:12:01,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:12:02,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,021 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:02,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:12:02,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:02,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:02,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-20 10:12:02,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:02,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:12:02,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:02,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:02,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-20 10:12:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:02,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:02,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:12:02,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:02,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:12:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:12:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:02,246 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-20 10:12:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:03,028 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-20 10:12:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:12:03,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:12:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:03,033 INFO L225 Difference]: With dead ends: 814 [2019-01-20 10:12:03,033 INFO L226 Difference]: Without dead ends: 811 [2019-01-20 10:12:03,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:12:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-20 10:12:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-20 10:12:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-20 10:12:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-20 10:12:03,325 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-20 10:12:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:03,325 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-20 10:12:03,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:12:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-20 10:12:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:03,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:03,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:03,326 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-20 10:12:03,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:03,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:03,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:03,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:03,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:03,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:03,418 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-20 10:12:03,418 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:03,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:03,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:03,421 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:03,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:03,422 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:03,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:03,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:03,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:03,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:12:03,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:12:03,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:12:03,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:03,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:03,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:03,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:03,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:03,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:03,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:12:03,664 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,687 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,706 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,721 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,733 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:03,776 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:12:03,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:12:03,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:03,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:12:03,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,886 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:03,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:12:03,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:03,918 INFO L267 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-01-20 10:12:03,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:12:03,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:03,950 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:03,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:12:03,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:04,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:04,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:12:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:04,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:04,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:04,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:12:04,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:04,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:12:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:12:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:12:04,076 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-20 10:12:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:05,058 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-20 10:12:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:12:05,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:12:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:05,062 INFO L225 Difference]: With dead ends: 812 [2019-01-20 10:12:05,062 INFO L226 Difference]: Without dead ends: 811 [2019-01-20 10:12:05,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:12:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-20 10:12:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-20 10:12:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-20 10:12:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-20 10:12:05,357 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-20 10:12:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:05,357 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-20 10:12:05,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:12:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-20 10:12:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:05,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:05,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:05,358 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-20 10:12:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:05,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:05,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:05,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:05,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:05,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:05,433 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-20 10:12:05,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:05,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:05,435 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:05,435 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:12:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:05,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:05,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:05,435 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:05,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:05,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:05,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:05,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:05,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:12:05,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:12:05,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,490 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:12:05,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:12:05,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:12:05,510 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:12:05,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:12:05,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,693 INFO L478 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 46 treesize of output 68 [2019-01-20 10:12:05,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:12:05,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:05,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:12:05,810 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,831 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,854 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,877 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,902 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:05,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:05,943 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:12:06,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:12:06,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:06,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:06,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-20 10:12:06,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:12:06,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:06,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-20 10:12:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:06,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:06,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:06,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:12:06,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:06,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:12:06,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:12:06,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:12:06,794 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-20 10:12:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:07,446 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-20 10:12:07,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:12:07,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:12:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:07,449 INFO L225 Difference]: With dead ends: 843 [2019-01-20 10:12:07,449 INFO L226 Difference]: Without dead ends: 842 [2019-01-20 10:12:07,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:12:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-20 10:12:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-20 10:12:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-20 10:12:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-20 10:12:07,760 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-20 10:12:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:07,760 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-20 10:12:07,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:12:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-20 10:12:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:07,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:07,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:07,761 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-20 10:12:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:07,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:07,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:07,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:07,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:07,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:07,824 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-20 10:12:07,825 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:07,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:07,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:07,826 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:07,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:07,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:07,826 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:07,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:07,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:07,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:07,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:12:07,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:12:07,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:12:07,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:07,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:08,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:08,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:08,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:08,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:08,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:12:08,089 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,113 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,132 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,147 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,170 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:08,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:08,201 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:12:08,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:12:08,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:08,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:08,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-20 10:12:08,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 103 [2019-01-20 10:12:08,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:12:08,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:08,893 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:08,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-01-20 10:12:08,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:09,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-01-20 10:12:09,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-20 10:12:09,841 WARN L181 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-20 10:12:09,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-20 10:12:09,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,978 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:09,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:09,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-01-20 10:12:09,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:10,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,104 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:10,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2019-01-20 10:12:10,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:10,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:10,227 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:10,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:12:10,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:10,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-20 10:12:10,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-20 10:12:10,456 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-01-20 10:12:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:10,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:10,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:10,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:12:10,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:10,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:12:10,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:12:10,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:10,536 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-20 10:12:10,724 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-20 10:12:11,006 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-20 10:12:11,160 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-01-20 10:12:11,356 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-20 10:12:12,105 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-20 10:12:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:14,387 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-20 10:12:14,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:12:14,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:12:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:14,391 INFO L225 Difference]: With dead ends: 896 [2019-01-20 10:12:14,391 INFO L226 Difference]: Without dead ends: 895 [2019-01-20 10:12:14,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:12:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-20 10:12:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-20 10:12:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-20 10:12:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-20 10:12:14,739 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-20 10:12:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:14,739 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-20 10:12:14,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:12:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-20 10:12:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:14,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:14,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:14,741 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-20 10:12:14,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:14,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:14,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:14,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:14,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:14,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:14,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:14,823 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:14,823 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-20 10:12:14,823 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:14,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:14,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:14,826 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:14,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:14,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:14,827 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:14,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:14,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:14,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:12:14,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:12:14,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:12:14,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:14,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:14,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:14,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:15,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:15,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:15,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:15,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:15,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:12:15,062 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,087 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,106 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,121 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,133 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:15,175 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:12:15,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:12:15,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,245 INFO L267 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-01-20 10:12:15,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:12:15,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:12:15,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,307 INFO L267 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-01-20 10:12:15,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:12:15,541 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-20 10:12:15,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:15,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:15,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:12:15,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:15,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:15,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:12:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:15,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:15,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:15,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:12:15,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:15,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:12:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:12:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:15,847 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-20 10:12:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:16,757 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-20 10:12:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:12:16,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:12:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:16,762 INFO L225 Difference]: With dead ends: 975 [2019-01-20 10:12:16,762 INFO L226 Difference]: Without dead ends: 973 [2019-01-20 10:12:16,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:12:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-20 10:12:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-20 10:12:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-20 10:12:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-20 10:12:17,140 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-20 10:12:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:17,141 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-20 10:12:17,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:12:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-20 10:12:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:17,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:17,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:17,143 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-20 10:12:17,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:17,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:17,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:17,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:17,213 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:17,213 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-20 10:12:17,214 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:17,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:17,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:17,216 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:12:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:17,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:17,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:17,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:17,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:17,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:17,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:17,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:17,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:12:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:12:17,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,254 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:12:17,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:12:17,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:12:17,304 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,330 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:12:17,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:12:17,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,464 INFO L478 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 32 treesize of output 57 [2019-01-20 10:12:17,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:12:17,509 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,523 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,537 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,552 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:17,581 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:12:17,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:12:17,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:17,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:17,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-20 10:12:17,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-01-20 10:12:17,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:17,822 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:17,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2019-01-20 10:12:17,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:17,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:17,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-20 10:12:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:17,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:17,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:17,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:12:17,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:17,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:12:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:12:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:12:17,998 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-20 10:12:19,109 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-20 10:12:19,255 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-20 10:12:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:20,066 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-20 10:12:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:12:20,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:12:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:20,069 INFO L225 Difference]: With dead ends: 985 [2019-01-20 10:12:20,069 INFO L226 Difference]: Without dead ends: 984 [2019-01-20 10:12:20,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-20 10:12:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-20 10:12:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-20 10:12:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-20 10:12:20,473 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-20 10:12:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:20,473 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-20 10:12:20,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:12:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-20 10:12:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:20,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:20,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:20,475 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-20 10:12:20,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:20,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:20,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:20,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:20,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:20,564 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:20,565 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-20 10:12:20,566 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:20,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:20,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:20,568 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:12:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:20,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:20,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:20,568 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:20,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:20,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:20,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:20,763 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-20 10:12:20,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:12:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:12:20,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:12:20,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:12:20,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:20,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:12:20,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:20,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,043 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:21,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:21,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:21,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:21,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:21,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:12:21,116 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,149 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,168 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,183 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,196 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:21,249 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:12:21,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:12:21,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:21,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:12:21,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:12:21,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,424 INFO L267 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-01-20 10:12:21,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:12:21,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,464 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:21,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:12:21,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:21,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:12:21,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,556 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:21,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:12:21,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:21,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:12:21,757 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-20 10:12:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:21,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:22,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:22,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:12:22,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:12:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:12:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:12:22,403 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-20 10:12:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:26,598 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-20 10:12:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:12:26,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:12:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:26,603 INFO L225 Difference]: With dead ends: 1024 [2019-01-20 10:12:26,603 INFO L226 Difference]: Without dead ends: 1023 [2019-01-20 10:12:26,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:12:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-20 10:12:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-20 10:12:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-20 10:12:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-20 10:12:26,994 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-20 10:12:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:26,994 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-20 10:12:26,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-20 10:12:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:26,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:26,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:26,996 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-20 10:12:26,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:26,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:27,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:27,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:27,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:27,185 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-20 10:12:27,188 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:27,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:27,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:27,189 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:12:27,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:27,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:27,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:27,191 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:27,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:27,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:27,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:27,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:27,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:27,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:27,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:27,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:12:27,258 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:12:27,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:12:27,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:12:27,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:12:27,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:12:27,602 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,626 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,650 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,675 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,700 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:27,744 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:12:27,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:12:27,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:27,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:12:27,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:12:27,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:27,916 INFO L267 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-01-20 10:12:27,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:12:27,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:27,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:27,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:12:27,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:28,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:28,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:12:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:28,053 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:28,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-20 10:12:28,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:28,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:28,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-20 10:12:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:28,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:12:28,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:12:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:12:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:12:28,201 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-20 10:12:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:29,455 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-20 10:12:29,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:12:29,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:12:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:29,459 INFO L225 Difference]: With dead ends: 1059 [2019-01-20 10:12:29,459 INFO L226 Difference]: Without dead ends: 1057 [2019-01-20 10:12:29,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:12:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-20 10:12:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-20 10:12:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-20 10:12:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-20 10:12:29,854 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-20 10:12:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:29,854 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-20 10:12:29,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-20 10:12:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:29,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:29,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:29,856 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-20 10:12:29,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:29,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:29,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:29,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:29,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:29,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:29,922 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-20 10:12:29,923 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:29,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:29,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:29,925 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:12:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:29,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:29,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:29,925 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:29,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:29,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:29,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:30,084 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-20 10:12:30,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:30,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:30,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:30,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:30,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:30,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:12:30,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,143 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:12:30,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:12:30,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:12:30,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:30,352 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,368 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,383 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,397 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:30,429 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-20 10:12:30,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:12:30,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:30,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:12:30,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:12:30,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:30,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-20 10:12:30,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,642 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:30,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:12:30,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,676 INFO L267 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-01-20 10:12:30,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-20 10:12:30,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:30,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:30,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-20 10:12:30,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:30,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:30,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:12:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:30,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:12:30,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:30,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:12:30,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:12:30,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:12:30,844 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-20 10:12:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:32,890 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-20 10:12:32,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:12:32,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:12:32,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:32,895 INFO L225 Difference]: With dead ends: 1044 [2019-01-20 10:12:32,895 INFO L226 Difference]: Without dead ends: 1042 [2019-01-20 10:12:32,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:12:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-20 10:12:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-20 10:12:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-20 10:12:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-20 10:12:33,307 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-20 10:12:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:33,307 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-20 10:12:33,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-20 10:12:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:33,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:33,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:33,309 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-20 10:12:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:33,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:33,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:33,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:33,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:33,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:12:33,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:12:33,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:33,441 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:33,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:12:33,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:12:33,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:12:33,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:12:33,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:33,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:12:33,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:12:33,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:12:33,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:12:33,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:33,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:12:33,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,729 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:33,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:33,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:33,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:33,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:33,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:12:33,853 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,887 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,906 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,922 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,934 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,945 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:33,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:33,989 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:12:34,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:12:34,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:34,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:34,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:12:34,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:12:34,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:34,162 INFO L267 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-01-20 10:12:34,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:12:34,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:34,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:12:34,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:34,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:34,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-20 10:12:34,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,301 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:34,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:34,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:12:34,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:34,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:34,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-20 10:12:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:34,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:34,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:34,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:12:34,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:34,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:12:34,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:12:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:12:34,452 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-20 10:12:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:35,677 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-20 10:12:35,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:12:35,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:12:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:35,682 INFO L225 Difference]: With dead ends: 1044 [2019-01-20 10:12:35,682 INFO L226 Difference]: Without dead ends: 1041 [2019-01-20 10:12:35,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:12:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-20 10:12:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-20 10:12:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-20 10:12:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-20 10:12:36,097 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-20 10:12:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:36,097 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-20 10:12:36,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-20 10:12:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:36,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:36,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:36,098 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-20 10:12:36,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:36,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:12:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:36,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:36,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:36,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:36,177 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:36,177 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-20 10:12:36,178 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:36,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:36,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:36,180 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:12:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:36,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:36,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:36,180 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:36,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:36,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:36,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:36,369 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-20 10:12:36,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:36,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:36,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:36,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:36,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:36,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:12:36,407 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,432 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:12:36,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:12:36,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:12:36,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:36,641 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,675 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,706 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:36,737 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:12:36,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:12:36,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:36,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:36,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-20 10:12:37,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,072 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:37,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-01-20 10:12:37,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,230 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:37,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-01-20 10:12:37,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:37,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-20 10:12:37,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-20 10:12:37,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 95 [2019-01-20 10:12:37,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:37,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-01-20 10:12:37,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:37,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2019-01-20 10:12:37,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:37,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-01-20 10:12:37,842 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-20 10:12:37,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-20 10:12:37,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:38,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,122 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:38,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 118 [2019-01-20 10:12:38,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-20 10:12:38,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:38,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 92 [2019-01-20 10:12:38,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:38,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:38,574 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:38,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 98 [2019-01-20 10:12:38,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:38,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:12:38,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-20 10:12:38,901 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-20 10:12:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:38,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:39,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:39,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:12:39,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:39,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:12:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:12:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:12:39,017 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-20 10:12:39,198 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-20 10:12:39,456 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-20 10:12:39,852 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-20 10:12:40,300 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-20 10:12:40,767 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-20 10:12:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:41,627 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-20 10:12:41,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:12:41,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:12:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:41,632 INFO L225 Difference]: With dead ends: 1104 [2019-01-20 10:12:41,632 INFO L226 Difference]: Without dead ends: 1102 [2019-01-20 10:12:41,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:12:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-20 10:12:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-20 10:12:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-20 10:12:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-20 10:12:42,047 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-20 10:12:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:42,047 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-20 10:12:42,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-20 10:12:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:42,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:42,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:42,049 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:42,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:42,049 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-20 10:12:42,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:42,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:42,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:42,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:42,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:42,166 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-20 10:12:42,167 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:42,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:42,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:42,168 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:12:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:42,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:42,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:42,169 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:42,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:42,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:42,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:42,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:12:42,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:12:42,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:12:42,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:42,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:42,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:12:42,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:12:42,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:12:42,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:12:42,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:12:42,496 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,521 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,577 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:42,632 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:12:42,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:12:42,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:42,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:12:42,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,748 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:42,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:12:42,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:42,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-20 10:12:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:12:42,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,840 INFO L267 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-01-20 10:12:42,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-20 10:12:42,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:42,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:42,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:12:42,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:42,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:42,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-20 10:12:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:42,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:42,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:42,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:12:42,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:42,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:12:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:12:42,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:12:42,989 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-20 10:12:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:45,269 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-20 10:12:45,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:12:45,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:12:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:45,275 INFO L225 Difference]: With dead ends: 1313 [2019-01-20 10:12:45,275 INFO L226 Difference]: Without dead ends: 1312 [2019-01-20 10:12:45,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:12:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-20 10:12:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-20 10:12:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-20 10:12:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-20 10:12:45,710 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-20 10:12:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:45,710 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-20 10:12:45,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-20 10:12:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:45,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:45,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:45,712 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-20 10:12:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:45,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:45,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:45,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:45,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:45,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:45,761 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-20 10:12:45,762 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:45,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:45,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:45,763 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:45,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:45,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:45,764 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:45,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:45,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:45,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:45,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:45,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:12:45,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:12:45,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,986 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:12:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:12:45,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:45,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:46,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:46,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:46,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:46,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:12:46,006 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:46,502 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:46,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:46,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:12:47,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:12:47,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,294 INFO L478 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 46 treesize of output 68 [2019-01-20 10:12:47,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:12:47,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:12:47,411 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,434 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,455 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,477 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,502 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:47,544 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:12:47,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:12:47,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,621 INFO L267 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-01-20 10:12:47,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:12:47,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-20 10:12:47,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:47,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-20 10:12:47,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,795 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:47,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:12:47,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:47,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-20 10:12:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:47,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:47,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:47,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:12:47,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:47,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:12:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:12:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:47,942 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-20 10:12:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:48,856 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-20 10:12:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:12:48,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:12:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:48,859 INFO L225 Difference]: With dead ends: 881 [2019-01-20 10:12:48,860 INFO L226 Difference]: Without dead ends: 880 [2019-01-20 10:12:48,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:12:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-20 10:12:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-20 10:12:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-20 10:12:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-20 10:12:49,287 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-20 10:12:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:49,287 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-20 10:12:49,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:12:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-20 10:12:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:49,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:49,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:49,288 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-20 10:12:49,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:49,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:49,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:49,668 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-20 10:12:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:49,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:49,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:49,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:49,699 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-20 10:12:49,700 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:49,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:49,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:49,702 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:49,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:49,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:49,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:49,702 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:49,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:49,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:49,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:49,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:49,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:12:49,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:12:49,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,740 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:12:49,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:12:49,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:12:49,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,804 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:12:49,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:12:49,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,918 INFO L478 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 32 treesize of output 57 [2019-01-20 10:12:49,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:49,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:12:49,962 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,977 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:49,990 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:50,004 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:50,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:50,033 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:12:50,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:12:50,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:50,099 INFO L267 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-01-20 10:12:50,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:12:50,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:12:50,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:50,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:50,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-20 10:12:50,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:50,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:50,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:12:50,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:50,385 INFO L267 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-01-20 10:12:50,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-20 10:12:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:50,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:50,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:50,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:12:50,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:50,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:12:50,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:12:50,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:12:50,444 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-20 10:12:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:53,203 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-20 10:12:53,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:12:53,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:12:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:53,208 INFO L225 Difference]: With dead ends: 1415 [2019-01-20 10:12:53,208 INFO L226 Difference]: Without dead ends: 1413 [2019-01-20 10:12:53,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-20 10:12:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-20 10:12:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-20 10:12:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-20 10:12:53,918 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-20 10:12:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:53,918 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-20 10:12:53,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:12:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-20 10:12:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:53,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:53,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:53,920 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-20 10:12:53,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:53,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:53,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:53,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:53,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:53,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:53,983 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-20 10:12:53,983 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:53,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:53,985 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:53,986 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:53,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:53,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:53,987 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:53,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:53,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:54,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:54,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:12:54,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:12:54,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,059 INFO L478 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 32 treesize of output 57 [2019-01-20 10:12:54,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:12:54,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,170 INFO L478 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 21 treesize of output 24 [2019-01-20 10:12:54,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:12:54,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:12:54,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:12:54,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:12:54,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:12:54,194 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,218 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,236 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,250 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,261 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,272 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:54,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:54,301 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:12:54,491 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-20 10:12:54,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:54,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:12:54,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-20 10:12:54,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-20 10:12:54,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:425 [2019-01-20 10:12:55,017 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 90 [2019-01-20 10:12:55,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 69 [2019-01-20 10:12:55,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:55,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:55,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 87 [2019-01-20 10:12:55,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:55,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,278 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:55,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 93 [2019-01-20 10:12:55,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:55,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-20 10:12:55,443 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:194, output treesize:184 [2019-01-20 10:12:55,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 75 [2019-01-20 10:12:55,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:55,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2019-01-20 10:12:55,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:55,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:55,694 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:55,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2019-01-20 10:12:55,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:55,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:12:55,738 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-20 10:12:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:55,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:55,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:55,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:12:55,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:55,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:12:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:12:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:55,883 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-20 10:12:56,241 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-20 10:12:56,887 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-20 10:12:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:57,718 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-20 10:12:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:12:57,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:12:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:57,723 INFO L225 Difference]: With dead ends: 1381 [2019-01-20 10:12:57,723 INFO L226 Difference]: Without dead ends: 1379 [2019-01-20 10:12:57,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:12:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-20 10:12:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-20 10:12:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-20 10:12:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-20 10:12:58,442 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-20 10:12:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:58,442 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-20 10:12:58,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:12:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-20 10:12:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:12:58,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:58,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:12:58,445 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-20 10:12:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:58,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:58,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:58,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:58,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:12:58,513 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-20 10:12:58,514 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:58,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:58,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:58,517 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:12:58,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:58,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:58,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:58,518 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:58,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:58,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:58,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:58,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:12:58,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:12:58,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,601 INFO L478 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 46 treesize of output 68 [2019-01-20 10:12:58,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:12:58,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:58,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:12:58,738 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,768 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:12:58,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:12:58,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:12:58,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:12:58,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:12:58,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:12:58,914 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,946 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,964 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,978 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:58,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,001 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:59,042 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:12:59,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:12:59,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:59,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:12:59,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,135 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:59,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:12:59,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:59,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:59,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-20 10:12:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:59,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:12:59,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:59,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:12:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:12:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:12:59,377 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-01-20 10:13:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:00,469 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-01-20 10:13:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:13:00,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:13:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:00,474 INFO L225 Difference]: With dead ends: 1306 [2019-01-20 10:13:00,474 INFO L226 Difference]: Without dead ends: 1305 [2019-01-20 10:13:00,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:13:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-01-20 10:13:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-01-20 10:13:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-20 10:13:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-20 10:13:01,189 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-20 10:13:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:01,189 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-20 10:13:01,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:13:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-20 10:13:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:13:01,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:01,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:13:01,192 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-01-20 10:13:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:01,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:01,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:01,376 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-20 10:13:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:01,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:01,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:01,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:13:01,429 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-01-20 10:13:01,430 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:01,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:01,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:01,432 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:13:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:01,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:01,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:01,433 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:01,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:01,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:01,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:01,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:13:01,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:13:01,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:13:01,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:13:01,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:01,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:13:01,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:01,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:13:01,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:13:01,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:13:01,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:13:01,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:13:01,844 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,876 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,910 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,922 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,934 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:01,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:01,977 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:13:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:13:02,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:02,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:02,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:13:02,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,113 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:02,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:13:02,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:02,161 INFO L267 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-01-20 10:13:02,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-01-20 10:13:02,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:13:02,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:02,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:02,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-01-20 10:13:02,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:02,290 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:02,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-20 10:13:02,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:02,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:02,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:13:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:02,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:02,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:02,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:13:02,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:02,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:13:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:13:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:13:02,447 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-01-20 10:13:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:03,979 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-01-20 10:13:03,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:13:03,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:13:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:03,985 INFO L225 Difference]: With dead ends: 1360 [2019-01-20 10:13:03,985 INFO L226 Difference]: Without dead ends: 1358 [2019-01-20 10:13:03,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:13:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-20 10:13:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-01-20 10:13:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-01-20 10:13:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-01-20 10:13:04,670 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-01-20 10:13:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:04,671 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-01-20 10:13:04,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:13:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-01-20 10:13:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:13:04,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:04,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:13:04,673 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-01-20 10:13:04,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:04,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:04,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:04,864 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-20 10:13:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:04,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:04,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:04,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:13:04,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:13:04,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:04,903 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:04,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:13:04,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:13:04,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:13:04,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:13:04,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:04,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:04,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:13:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:04,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:04,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:13:05,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:13:05,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:13:05,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:13:05,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:05,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:13:05,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:13:05,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:13:05,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:13:05,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:13:05,304 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,339 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,358 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,374 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,387 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,397 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:05,442 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:13:05,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:13:05,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,511 INFO L267 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-01-20 10:13:05,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:13:05,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:13:05,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:05,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:13:05,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:05,622 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:05,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:13:05,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:05,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:05,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-20 10:13:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:05,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:05,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:05,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:13:05,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:05,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:13:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:13:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:13:05,747 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-01-20 10:13:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:07,475 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-01-20 10:13:07,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:13:07,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:13:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:07,481 INFO L225 Difference]: With dead ends: 1898 [2019-01-20 10:13:07,481 INFO L226 Difference]: Without dead ends: 1896 [2019-01-20 10:13:07,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:13:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-20 10:13:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-01-20 10:13:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-01-20 10:13:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-01-20 10:13:08,501 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-01-20 10:13:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:08,502 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-01-20 10:13:08,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:13:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-01-20 10:13:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:13:08,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:08,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:13:08,506 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-01-20 10:13:08,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:08,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:13:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:08,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:08,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:13:08,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:13:08,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:13:08,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:13:08,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:13:08,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:13:08,593 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-01-20 10:13:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:09,709 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-01-20 10:13:09,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:13:09,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-20 10:13:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:09,714 INFO L225 Difference]: With dead ends: 1693 [2019-01-20 10:13:09,714 INFO L226 Difference]: Without dead ends: 1692 [2019-01-20 10:13:09,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:13:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-01-20 10:13:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-01-20 10:13:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-20 10:13:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-01-20 10:13:10,713 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-01-20 10:13:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:10,713 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-01-20 10:13:10,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:13:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-01-20 10:13:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:13:10,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:10,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:13:10,716 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-01-20 10:13:10,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:10,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:10,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:10,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:10,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:10,852 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-20 10:13:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:10,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:10,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:10,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:13:10,864 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-01-20 10:13:10,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:10,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:10,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:10,866 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:13:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:10,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:10,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:10,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:10,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:10,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:10,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:10,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:10,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:13:10,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:13:10,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,903 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:13:10,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:13:10,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:10,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:13:10,921 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:10,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:10,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:10,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:13:11,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:13:11,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,108 INFO L478 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 46 treesize of output 68 [2019-01-20 10:13:11,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:13:11,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:13:11,225 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,248 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,271 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,295 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,319 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:11,361 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-20 10:13:11,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:13:11,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:11,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:13:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:11,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-01-20 10:13:11,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:11,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:11,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-01-20 10:13:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:11,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:11,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:11,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:13:11,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:11,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:13:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:13:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:13:11,546 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-01-20 10:13:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:13,611 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-01-20 10:13:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:13:13,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:13:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:13,619 INFO L225 Difference]: With dead ends: 2759 [2019-01-20 10:13:13,619 INFO L226 Difference]: Without dead ends: 2757 [2019-01-20 10:13:13,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:13:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-01-20 10:13:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-01-20 10:13:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-01-20 10:13:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-01-20 10:13:15,341 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-01-20 10:13:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:15,341 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-01-20 10:13:15,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:13:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-01-20 10:13:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:13:15,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:15,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:13:15,345 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-01-20 10:13:15,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:15,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:15,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:15,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:15,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:15,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:13:15,476 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-01-20 10:13:15,477 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:15,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:15,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:15,479 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:13:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:15,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:15,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:15,479 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:15,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:15,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:15,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:15,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:15,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:13:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:13:15,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:13:15,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:13:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:13:15,558 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:15,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:15,620 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:15,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:15,653 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:15,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:15,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:13:15,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:13:15,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:13:15,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:15,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:13:16,299 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-20 10:13:16,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:13:16,311 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,337 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,361 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,386 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,411 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:16,455 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:13:16,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:13:16,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,533 INFO L267 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-01-20 10:13:16,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:13:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,569 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:16,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:13:16,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,615 INFO L267 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-01-20 10:13:16,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-20 10:13:16,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:13:16,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:16,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-20 10:13:16,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,740 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:16,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:16,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:13:16,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:16,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:16,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-20 10:13:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:16,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:16,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:16,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:13:16,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:16,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:13:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:13:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:13:16,931 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-01-20 10:13:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:20,392 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-01-20 10:13:20,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:13:20,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:13:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:20,404 INFO L225 Difference]: With dead ends: 3636 [2019-01-20 10:13:20,404 INFO L226 Difference]: Without dead ends: 3626 [2019-01-20 10:13:20,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:13:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-20 10:13:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-01-20 10:13:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-20 10:13:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-01-20 10:13:23,024 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-01-20 10:13:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:23,025 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-01-20 10:13:23,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:13:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-01-20 10:13:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:13:23,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:23,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:13:23,029 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-01-20 10:13:23,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:23,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:23,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:23,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:23,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:23,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:23,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:23,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:13:23,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:13:23,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:23,083 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:23,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:13:23,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:13:23,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:13:23,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:13:23,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:23,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:23,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:13:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:13:23,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,120 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:13:23,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:13:23,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:13:23,139 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,177 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:13:23,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:13:23,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,324 INFO L478 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 46 treesize of output 68 [2019-01-20 10:13:23,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:13:23,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:13:23,442 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,466 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,489 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,512 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,538 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:23,580 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:13:23,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:13:23,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:23,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:13:23,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:13:23,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:13:23,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:13:23,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-01-20 10:13:23,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:23,945 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:23,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:13:23,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:23,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:23,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-01-20 10:13:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:23,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:24,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:24,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:13:24,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:24,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:13:24,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:13:24,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:13:24,056 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-01-20 10:13:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:28,116 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-01-20 10:13:28,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:13:28,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:13:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:28,129 INFO L225 Difference]: With dead ends: 4300 [2019-01-20 10:13:28,129 INFO L226 Difference]: Without dead ends: 4298 [2019-01-20 10:13:28,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:13:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-01-20 10:13:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-01-20 10:13:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-01-20 10:13:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-01-20 10:13:31,838 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-01-20 10:13:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:31,838 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-01-20 10:13:31,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:13:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-01-20 10:13:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:13:31,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:31,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:13:31,843 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-01-20 10:13:31,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:31,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:31,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:13:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:31,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:31,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:31,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:31,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:13:31,910 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-01-20 10:13:31,911 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:31,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:31,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:31,913 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:13:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:31,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:31,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:31,914 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:31,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:31,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:31,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:31,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:31,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:13:31,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:13:31,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:13:31,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:13:31,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:31,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:13:31,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:13:32,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:13:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:13:32,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:13:32,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:13:32,341 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,366 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,390 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,415 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,441 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:32,485 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:13:32,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:13:32,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:32,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:13:32,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:13:32,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,654 INFO L267 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-01-20 10:13:32,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:13:32,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,697 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:32,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:13:32,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:32,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-20 10:13:32,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:32,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:32,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:13:32,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:32,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:32,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-20 10:13:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:32,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:32,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:32,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:13:32,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:32,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:13:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:13:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:13:32,942 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-01-20 10:13:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:37,312 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-01-20 10:13:37,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:13:37,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:13:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:37,326 INFO L225 Difference]: With dead ends: 4236 [2019-01-20 10:13:37,326 INFO L226 Difference]: Without dead ends: 4233 [2019-01-20 10:13:37,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:13:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-01-20 10:13:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-01-20 10:13:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-01-20 10:13:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-01-20 10:13:40,911 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-01-20 10:13:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:40,912 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-01-20 10:13:40,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:13:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-01-20 10:13:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:13:40,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:40,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:13:40,917 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-01-20 10:13:40,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:40,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:41,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:41,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:41,015 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:13:41,015 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-01-20 10:13:41,016 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:41,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:41,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:41,018 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:13:41,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:41,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:41,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:41,019 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:41,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:41,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:41,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:41,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:13:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:13:41,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:13:41,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:13:41,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:41,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:13:41,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:13:41,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:13:41,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:13:41,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:13:41,364 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,389 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,408 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,424 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,436 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:41,479 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-20 10:13:41,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:13:41,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:41,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:13:41,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:13:41,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:41,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:13:41,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:41,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:13:41,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,723 INFO L267 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-01-20 10:13:41,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:13:41,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:41,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:41,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:13:41,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:41,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:41,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:13:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:41,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:41,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:41,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:13:41,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:41,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:13:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:13:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:13:41,893 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-01-20 10:13:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:46,068 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-01-20 10:13:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:13:46,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:13:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:46,082 INFO L225 Difference]: With dead ends: 4232 [2019-01-20 10:13:46,082 INFO L226 Difference]: Without dead ends: 4231 [2019-01-20 10:13:46,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:13:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-01-20 10:13:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-01-20 10:13:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-01-20 10:13:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-01-20 10:13:49,756 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-01-20 10:13:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:49,756 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-01-20 10:13:49,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:13:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-01-20 10:13:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:13:49,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:49,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:13:49,762 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:49,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-01-20 10:13:49,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:49,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:49,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:49,940 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:13:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:49,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:49,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:49,991 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:13:49,991 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-01-20 10:13:49,992 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:49,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:49,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:49,994 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:13:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:49,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:49,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:49,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:50,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:50,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:50,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:50,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:13:50,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:13:50,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,078 INFO L478 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 46 treesize of output 68 [2019-01-20 10:13:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:13:50,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:13:50,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:50,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:13:50,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:13:50,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:13:50,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:13:50,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:13:50,473 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,505 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,523 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,537 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,547 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,559 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:50,600 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:13:50,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:13:50,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,674 INFO L267 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-01-20 10:13:50,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:13:50,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:13:50,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:13:50,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:13:50,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-01-20 10:13:50,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,950 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:50,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:13:50,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:50,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:13:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:51,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:51,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:51,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:13:51,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:13:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:13:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:13:51,062 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-01-20 10:13:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:55,240 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-01-20 10:13:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:13:55,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:13:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:55,253 INFO L225 Difference]: With dead ends: 4570 [2019-01-20 10:13:55,253 INFO L226 Difference]: Without dead ends: 4569 [2019-01-20 10:13:55,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:13:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-01-20 10:13:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-01-20 10:13:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-20 10:13:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-01-20 10:13:59,080 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-01-20 10:13:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:59,080 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-01-20 10:13:59,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:13:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-01-20 10:13:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:13:59,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:59,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:13:59,087 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:59,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:59,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-01-20 10:13:59,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:59,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:59,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:59,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:59,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:59,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:13:59,306 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-01-20 10:13:59,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:59,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:59,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:59,309 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:13:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:59,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:59,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:59,310 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:59,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:59,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:59,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:59,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:13:59,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:13:59,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:13:59,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:13:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:13:59,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:13:59,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,413 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:13:59,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:13:59,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:13:59,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:13:59,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:13:59,719 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,744 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,769 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,793 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:59,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:59,863 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:13:59,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:59,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:13:59,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:00,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:00,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:14:00,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:14:00,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:00,149 INFO L267 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-01-20 10:14:00,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:14:00,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,191 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:00,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:14:00,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:00,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:00,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:14:00,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:00,291 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:00,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 131 [2019-01-20 10:14:00,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:00,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:00,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-20 10:14:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:00,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:14:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:00,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:14:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:14:00,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:14:00,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:14:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:14:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:14:00,484 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-01-20 10:14:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:06,467 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-01-20 10:14:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:14:06,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:14:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:06,485 INFO L225 Difference]: With dead ends: 5928 [2019-01-20 10:14:06,485 INFO L226 Difference]: Without dead ends: 5927 [2019-01-20 10:14:06,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:14:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-01-20 10:14:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-01-20 10:14:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-20 10:14:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-01-20 10:14:11,705 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-01-20 10:14:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:11,705 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-01-20 10:14:11,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:14:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-01-20 10:14:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:14:11,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:11,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:14:11,712 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-01-20 10:14:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:11,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:14:11,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:11,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:14:11,839 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:14:11,839 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-01-20 10:14:11,840 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:14:11,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:14:11,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:14:11,841 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:14:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:11,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:14:11,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:11,842 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:14:11,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:11,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:14:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:11,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:14:11,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:14:11,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:14:11,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:14:11,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,875 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:14:11,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:14:11,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:14:11,894 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:11,919 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:11,939 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:11,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:11,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:11,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:14:12,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:14:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,054 INFO L478 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 32 treesize of output 57 [2019-01-20 10:14:12,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:14:12,099 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,113 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,127 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,143 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:12,172 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-20 10:14:12,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:14:12,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:12,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:14:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:14:12,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:14:12,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:14:12,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-20 10:14:12,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,432 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:12,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-20 10:14:12,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,498 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:12,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-20 10:14:12,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:14:12,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-20 10:14:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:14,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:14:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:14,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:14:14,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:14:14,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:14:14,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:14:14,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:14:14,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2019-01-20 10:14:14,647 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-01-20 10:14:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:21,666 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-01-20 10:14:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:14:21,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:14:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:21,686 INFO L225 Difference]: With dead ends: 6511 [2019-01-20 10:14:21,686 INFO L226 Difference]: Without dead ends: 6510 [2019-01-20 10:14:21,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=105, Invalid=200, Unknown=1, NotChecked=0, Total=306 [2019-01-20 10:14:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-20 10:14:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-01-20 10:14:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-01-20 10:14:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-01-20 10:14:28,372 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-01-20 10:14:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:28,372 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-01-20 10:14:28,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:14:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-01-20 10:14:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:14:28,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:28,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:14:28,380 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-01-20 10:14:28,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:28,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:28,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:28,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:14:28,675 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:14:28,675 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-01-20 10:14:28,676 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:14:28,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:14:28,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:14:28,679 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:14:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:28,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:14:28,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:28,679 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:14:28,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:28,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:14:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:28,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:14:28,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:14:28,834 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-20 10:14:28,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:14:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,879 INFO L478 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 46 treesize of output 68 [2019-01-20 10:14:28,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:14:28,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:28,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:14:28,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,020 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,068 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:14:29,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:14:29,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:14:29,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:14:29,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:14:29,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:14:29,148 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,180 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,198 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,212 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:29,275 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-01-20 10:14:29,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:14:29,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:29,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:14:29,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:14:29,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:29,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:14:29,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,487 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:29,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:14:29,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,522 INFO L267 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-01-20 10:14:29,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-20 10:14:29,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:29,568 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:29,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-20 10:14:29,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:29,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:29,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:14:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:29,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:14:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:29,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:14:29,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:14:29,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:14:29,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:14:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:14:29,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:14:29,713 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-01-20 10:14:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:38,482 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-01-20 10:14:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 10:14:38,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:14:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:38,504 INFO L225 Difference]: With dead ends: 7179 [2019-01-20 10:14:38,504 INFO L226 Difference]: Without dead ends: 7170 [2019-01-20 10:14:38,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:14:38,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-01-20 10:14:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-01-20 10:14:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-20 10:14:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-01-20 10:14:45,499 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-01-20 10:14:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:45,499 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-01-20 10:14:45,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:14:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-01-20 10:14:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:14:45,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:45,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:14:45,506 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-01-20 10:14:45,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:45,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:45,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:45,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:45,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:14:45,563 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:14:45,563 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-01-20 10:14:45,564 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:14:45,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:14:45,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:14:45,566 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:14:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:45,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:14:45,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:45,567 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:14:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:45,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:14:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:45,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:14:45,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-20 10:14:45,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-20 10:14:45,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-20 10:14:45,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,619 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-20 10:14:45,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-20 10:14:45,671 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,717 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:14:45,758 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:14:45,762 INFO L478 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 26 treesize of output 28 [2019-01-20 10:14:45,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-20 10:14:45,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-20 10:14:45,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:14:45,789 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,814 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,825 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,837 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:45,889 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-01-20 10:14:45,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-01-20 10:14:45,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:14:46,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-01-20 10:14:46,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:369 [2019-01-20 10:14:46,342 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 20 [2019-01-20 10:14:46,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-20 10:14:46,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:46,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:46,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-20 10:14:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:46,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:14:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:46,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:14:46,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:14:46,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:14:46,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:14:46,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:14:46,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:14:46,400 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-01-20 10:14:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:56,375 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-01-20 10:14:56,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:14:56,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:14:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:56,408 INFO L225 Difference]: With dead ends: 10441 [2019-01-20 10:14:56,408 INFO L226 Difference]: Without dead ends: 10440 [2019-01-20 10:14:56,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:14:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-01-20 10:15:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-01-20 10:15:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-01-20 10:15:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-01-20 10:15:07,276 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-01-20 10:15:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:07,277 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-01-20 10:15:07,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:15:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-01-20 10:15:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:15:07,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:07,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:07,286 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-01-20 10:15:07,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:07,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:07,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:07,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:07,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:07,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:15:07,374 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-01-20 10:15:07,375 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:07,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:07,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:07,377 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:15:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:07,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:07,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:07,378 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:07,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:07,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:07,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:07,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:15:07,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:15:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:15:07,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,410 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:15:07,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:15:07,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:15:07,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:15:07,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:15:07,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,615 INFO L478 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 46 treesize of output 68 [2019-01-20 10:15:07,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:15:07,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:15:07,733 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,757 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,779 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,803 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,826 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:07,867 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:15:07,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:15:07,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:07,941 INFO L267 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-01-20 10:15:07,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:15:07,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:07,972 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:07,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-20 10:15:07,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:08,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:08,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-01-20 10:15:08,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:08,050 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:08,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 108 [2019-01-20 10:15:08,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:15:08,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:08,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-01-20 10:15:08,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-01-20 10:15:08,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:08,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:08,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:15:08,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:08,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:15:08,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:15:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:15:08,290 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-01-20 10:15:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:20,804 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-01-20 10:15:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:15:20,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:15:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:20,839 INFO L225 Difference]: With dead ends: 10427 [2019-01-20 10:15:20,839 INFO L226 Difference]: Without dead ends: 10426 [2019-01-20 10:15:20,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:15:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-01-20 10:15:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-01-20 10:15:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-01-20 10:15:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-01-20 10:15:31,176 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-01-20 10:15:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:31,176 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-01-20 10:15:31,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:15:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-01-20 10:15:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:15:31,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:31,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:31,186 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-01-20 10:15:31,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:31,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:31,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:31,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:31,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:31,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:15:31,302 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-01-20 10:15:31,302 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:31,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:31,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:31,304 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:15:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:31,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:31,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:31,304 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:31,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:31,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:31,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:31,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:15:31,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:15:31,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:15:31,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,345 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:15:31,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:15:31,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:15:31,362 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:31,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:15:31,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,521 INFO L478 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 32 treesize of output 57 [2019-01-20 10:15:31,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:31,566 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,581 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,594 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,610 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:31,639 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-20 10:15:31,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:15:31,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:31,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:15:31,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,727 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:31,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-20 10:15:31,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:31,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-20 10:15:31,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-20 10:15:31,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:31,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:15:31,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:31,820 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:31,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-20 10:15:31,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,842 INFO L267 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-01-20 10:15:31,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:15:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:31,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:31,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:31,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:15:31,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:31,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:15:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:15:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:15:31,950 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-01-20 10:15:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:43,120 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-01-20 10:15:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:15:43,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:15:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:43,159 INFO L225 Difference]: With dead ends: 11408 [2019-01-20 10:15:43,160 INFO L226 Difference]: Without dead ends: 11406 [2019-01-20 10:15:43,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:15:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-01-20 10:15:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-01-20 10:15:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-20 10:15:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-01-20 10:15:53,913 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-01-20 10:15:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:53,913 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-01-20 10:15:53,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:15:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-01-20 10:15:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:15:53,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:53,924 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:15:53,924 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:53,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-01-20 10:15:53,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:53,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:53,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:53,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:53,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:54,077 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-01-20 10:15:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:54,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:54,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:54,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:15:54,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:15:54,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:54,158 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:54,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:15:54,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:15:54,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:15:54,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:15:54,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:54,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:15:54,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:15:54,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:15:54,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:15:54,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,466 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-20 10:15:54,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:15:54,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:15:54,550 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:15:54,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:15:54,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:15:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:15:54,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:54,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:15:54,890 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,915 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,940 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,964 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:54,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:55,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:55,034 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:15:55,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:15:55,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:55,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:55,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:15:55,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:15:55,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:55,204 INFO L267 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-01-20 10:15:55,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:15:55,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:55,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-20 10:15:55,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:55,372 INFO L267 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-01-20 10:15:55,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-01-20 10:15:55,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:55,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:15:55,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:55,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:55,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-01-20 10:15:55,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:55,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-20 10:15:55,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:55,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:55,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-01-20 10:15:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:55,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:55,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:55,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:15:55,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:55,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:15:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:15:55,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:15:55,674 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-01-20 10:16:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:16:10,397 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-01-20 10:16:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:16:10,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:16:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:16:10,449 INFO L225 Difference]: With dead ends: 14692 [2019-01-20 10:16:10,449 INFO L226 Difference]: Without dead ends: 14688 [2019-01-20 10:16:10,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:16:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-01-20 10:16:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-01-20 10:16:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-01-20 10:16:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-01-20 10:16:23,369 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-01-20 10:16:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:16:23,369 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-01-20 10:16:23,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:16:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-01-20 10:16:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:16:23,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:16:23,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:16:23,380 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:16:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-01-20 10:16:23,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:16:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:23,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:16:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:23,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:16:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:23,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-01-20 10:16:23,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:23,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:16:23,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:16:23,420 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-01-20 10:16:23,421 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:16:23,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:16:23,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:16:23,423 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:16:23,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:23,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:16:23,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:23,424 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:16:23,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:23,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:16:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:23,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:16:23,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:16:23,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:16:23,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:16:23,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,478 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:16:23,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:16:23,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:16:23,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,533 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:16:23,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:16:23,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,680 INFO L478 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 46 treesize of output 68 [2019-01-20 10:16:23,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:16:23,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:16:23,798 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,822 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,844 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,892 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:23,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:23,934 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:16:23,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:23,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:16:23,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:24,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:24,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:16:24,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-01-20 10:16:24,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:24,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:24,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-20 10:16:24,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:24,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:24,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:16:24,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:24,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:24,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-20 10:16:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:24,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:16:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:24,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:16:24,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:16:24,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:16:24,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:16:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:16:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:16:24,296 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-01-20 10:16:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:16:36,743 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-01-20 10:16:36,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:16:36,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:16:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:16:36,790 INFO L225 Difference]: With dead ends: 13016 [2019-01-20 10:16:36,790 INFO L226 Difference]: Without dead ends: 13015 [2019-01-20 10:16:36,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:16:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-01-20 10:16:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-01-20 10:16:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-20 10:16:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-20 10:16:50,530 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-20 10:16:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:16:50,530 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-20 10:16:50,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:16:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-20 10:16:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:16:50,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:16:50,542 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:16:50,542 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:16:50,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-01-20 10:16:50,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:16:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:50,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:50,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:16:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:50,744 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-20 10:16:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:16:50,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:50,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:16:50,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:16:50,753 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-01-20 10:16:50,754 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:16:50,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:16:50,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:16:50,756 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:16:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:50,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:16:50,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:50,756 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:16:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:50,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:16:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:50,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:16:50,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:16:50,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:16:50,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:16:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,793 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:16:50,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:16:50,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:16:50,809 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:50,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:50,857 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:50,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:50,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:50,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:50,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:16:50,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:16:50,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:50,968 INFO L478 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 32 treesize of output 57 [2019-01-20 10:16:51,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:51,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:51,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:51,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:51,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:51,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:51,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:16:51,013 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:51,028 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:51,041 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:51,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:51,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:51,086 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:16:51,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:51,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:16:51,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:16:51,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:16:51,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-20 10:16:53,258 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-01-20 10:16:53,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:53,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:53,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:53,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:53,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:53,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:53,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:16:53,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:53,288 INFO L267 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-01-20 10:16:53,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-01-20 10:16:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:53,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:16:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:53,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:16:53,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:16:53,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:16:53,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:16:53,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:16:53,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:16:53,338 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-01-20 10:17:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:17:05,505 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-01-20 10:17:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:17:05,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:17:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:17:05,552 INFO L225 Difference]: With dead ends: 12974 [2019-01-20 10:17:05,552 INFO L226 Difference]: Without dead ends: 12973 [2019-01-20 10:17:05,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:17:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-01-20 10:17:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-01-20 10:17:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-20 10:17:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-20 10:17:18,667 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-20 10:17:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:17:18,667 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-20 10:17:18,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:17:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-20 10:17:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:17:18,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:17:18,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:17:18,677 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:17:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-01-20 10:17:18,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:17:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:18,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:17:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:17:18,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:18,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:17:18,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:17:18,762 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-01-20 10:17:18,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:17:18,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:17:18,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:17:18,764 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:17:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:18,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:17:18,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:18,765 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:17:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:18,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:17:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:18,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:17:18,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:17:18,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:17:18,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:17:18,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,800 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:17:18,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:17:18,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:17:18,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:18,857 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:18,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:18,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:18,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:18,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:18,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:17:18,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:18,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:17:19,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,007 INFO L478 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 46 treesize of output 68 [2019-01-20 10:17:19,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:17:19,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:17:19,125 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:19,147 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:19,168 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:19,191 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:19,214 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:19,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:19,260 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:17:19,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:17:19,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:17:19,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:17:19,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-20 10:17:19,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,505 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:19,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:17:19,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:19,541 INFO L267 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-01-20 10:17:19,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-20 10:17:19,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:19,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:17:19,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:19,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:19,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-20 10:17:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:19,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:17:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:19,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:17:19,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:17:19,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:17:19,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:17:19,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:17:19,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:17:19,678 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-01-20 10:17:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:17:32,772 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-01-20 10:17:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:17:32,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:17:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:17:32,815 INFO L225 Difference]: With dead ends: 13106 [2019-01-20 10:17:32,815 INFO L226 Difference]: Without dead ends: 13105 [2019-01-20 10:17:32,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:17:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-01-20 10:17:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-01-20 10:17:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-01-20 10:17:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-01-20 10:17:45,760 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-01-20 10:17:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:17:45,760 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-01-20 10:17:45,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:17:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-01-20 10:17:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:17:45,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:17:45,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:17:45,770 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:17:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-01-20 10:17:45,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:17:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:45,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:45,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:17:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:17:45,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:45,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:17:45,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:17:45,849 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-01-20 10:17:45,850 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:17:45,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:17:45,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:17:45,852 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:17:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:45,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:17:45,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:45,853 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:17:45,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:45,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:17:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:45,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:17:45,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:17:45,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:17:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:17:45,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:17:45,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:17:45,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:45,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:17:45,917 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:45,956 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:45,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:45,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:17:46,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:17:46,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:17:46,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:17:46,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:17:46,263 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,288 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,313 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,338 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,363 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:46,406 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:17:46,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:17:46,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:46,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:17:46,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,556 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:46,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:17:46,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,601 INFO L267 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-01-20 10:17:46,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-20 10:17:46,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:17:46,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:46,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-20 10:17:46,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:46,731 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:46,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:17:46,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:46,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:46,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-20 10:17:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:46,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:17:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:46,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:17:46,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:17:46,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:17:46,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:17:46,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:17:46,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:17:46,896 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-01-20 10:18:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:18:00,065 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-01-20 10:18:00,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:18:00,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:18:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:18:00,111 INFO L225 Difference]: With dead ends: 13278 [2019-01-20 10:18:00,111 INFO L226 Difference]: Without dead ends: 13277 [2019-01-20 10:18:00,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:18:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-01-20 10:18:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-01-20 10:18:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-01-20 10:18:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-01-20 10:18:13,255 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-01-20 10:18:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:18:13,256 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-01-20 10:18:13,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:18:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-01-20 10:18:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:18:13,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:18:13,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:18:13,267 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:18:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:18:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-01-20 10:18:13,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:18:13,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:13,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:18:13,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:13,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:18:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:18:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:13,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:13,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:18:13,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:18:13,406 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-01-20 10:18:13,407 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:18:13,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:18:13,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:18:13,409 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:18:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:18:13,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:18:13,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:13,410 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:18:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:18:13,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:18:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:18:13,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:18:14,264 WARN L181 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-20 10:18:14,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:18:14,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:18:14,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:18:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:18:14,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:18:14,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:18:14,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,323 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:18:14,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:18:14,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:18:14,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:18:14,535 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,551 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,565 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,580 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:18:14,612 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:18:14,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:18:14,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:18:14,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:18:14,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,728 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:14,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:18:14,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,759 INFO L267 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-01-20 10:18:14,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:18:14,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:18:14,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,823 INFO L267 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-01-20 10:18:14,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-20 10:18:14,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:14,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:18:14,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:18:14,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:18:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:14,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:18:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:14,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:18:14,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:18:14,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:18:14,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:18:14,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:18:14,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:18:14,992 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-01-20 10:18:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:18:31,140 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-01-20 10:18:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:18:31,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:18:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:18:31,202 INFO L225 Difference]: With dead ends: 17581 [2019-01-20 10:18:31,202 INFO L226 Difference]: Without dead ends: 17580 [2019-01-20 10:18:31,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:18:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-01-20 10:18:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-01-20 10:18:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-20 10:18:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-20 10:18:41,688 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-20 10:18:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:18:41,688 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-20 10:18:41,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:18:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-20 10:18:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:18:41,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:18:41,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:18:41,696 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:18:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:18:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-01-20 10:18:41,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:18:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:41,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:18:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:41,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:18:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:18:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:18:41,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:41,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:18:41,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:18:41,758 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-01-20 10:18:41,758 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:18:41,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:18:41,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:18:41,760 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:18:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:18:41,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:18:41,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:41,761 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:18:41,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:18:41,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:18:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:18:41,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:18:41,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:18:41,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:18:41,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:18:41,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,796 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:18:41,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:18:41,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:18:41,816 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:41,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:41,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:41,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:41,903 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:41,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:41,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:18:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:18:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:41,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,002 INFO L478 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 46 treesize of output 68 [2019-01-20 10:18:42,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:18:42,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:18:42,119 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:42,142 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:42,165 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:42,189 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:42,214 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:42,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:18:42,256 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:18:42,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:18:42,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:18:42,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:42,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-20 10:18:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:42,497 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:42,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:18:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:42,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:18:42,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-01-20 10:18:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:42,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:18:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:18:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:18:42,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:18:42,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:18:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:18:42,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:18:42,589 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-01-20 10:18:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:18:52,547 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-01-20 10:18:52,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:18:52,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:18:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:18:52,579 INFO L225 Difference]: With dead ends: 9947 [2019-01-20 10:18:52,579 INFO L226 Difference]: Without dead ends: 9946 [2019-01-20 10:18:52,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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-01-20 10:18:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-01-20 10:19:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-01-20 10:19:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-20 10:19:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-20 10:19:02,900 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-20 10:19:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:02,900 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-20 10:19:02,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:19:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-20 10:19:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:19:02,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:19:02,908 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:19:02,908 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:19:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-01-20 10:19:02,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:19:02,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:02,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:02,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:19:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:19:02,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:02,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:19:02,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:19:02,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:19:02,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:02,977 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:19:02,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:19:02,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:19:02,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:19:02,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:19:02,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:19:03,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:19:03,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:19:03,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:19:03,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:19:03,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:19:03,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:19:03,047 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,095 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:19:03,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:19:03,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:19:03,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:19:03,283 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,298 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,313 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,329 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:03,360 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:19:03,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:19:03,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:19:03,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:03,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-01-20 10:19:03,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:03,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-20 10:19:03,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:03,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:03,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-20 10:19:03,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-20 10:19:04,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-01-20 10:19:04,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-01-20 10:19:04,256 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-01-20 10:19:04,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,271 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:04,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2019-01-20 10:19:04,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:04,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:19:04,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:04,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,560 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:04,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 113 [2019-01-20 10:19:04,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:04,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-01-20 10:19:04,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:04,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-20 10:19:04,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-01-20 10:19:04,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2019-01-20 10:19:04,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:04,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:19:04,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:05,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 108 [2019-01-20 10:19:05,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:05,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2019-01-20 10:19:05,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:05,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:19:05,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-01-20 10:19:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,439 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:05,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 123 [2019-01-20 10:19:05,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:05,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-01-20 10:19:05,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:05,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,712 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:05,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 125 [2019-01-20 10:19:05,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:05,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:19:05,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:05,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-20 10:19:05,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-01-20 10:19:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:06,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:19:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:06,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:19:06,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:19:06,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:19:06,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:19:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:19:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:19:06,168 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-01-20 10:19:06,360 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-20 10:19:06,625 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-01-20 10:19:06,913 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-01-20 10:19:08,085 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-01-20 10:19:09,598 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-01-20 10:19:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:19:21,929 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-01-20 10:19:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:19:21,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:19:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:19:21,969 INFO L225 Difference]: With dead ends: 12394 [2019-01-20 10:19:21,969 INFO L226 Difference]: Without dead ends: 12392 [2019-01-20 10:19:21,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-01-20 10:19:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-01-20 10:19:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-01-20 10:19:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-01-20 10:19:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-01-20 10:19:30,695 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-01-20 10:19:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:30,696 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-01-20 10:19:30,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:19:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-01-20 10:19:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:19:30,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:19:30,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:19:30,702 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:19:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-01-20 10:19:30,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:19:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:30,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:19:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:30,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:19:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:19:30,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:30,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:19:30,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:19:30,772 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-01-20 10:19:30,772 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:19:30,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:19:30,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:19:30,774 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:19:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:30,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:19:30,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:30,775 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:19:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:30,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:19:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:30,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:19:30,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:19:30,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:19:30,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:19:30,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,809 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:19:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:19:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:19:30,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:30,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:30,885 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:30,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:30,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:30,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:30,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:19:30,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:30,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:19:31,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,011 INFO L478 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 46 treesize of output 68 [2019-01-20 10:19:31,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:19:31,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:19:31,129 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,151 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,173 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,222 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:31,263 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:19:31,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:19:31,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:19:31,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:31,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-20 10:19:31,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-01-20 10:19:31,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 127 [2019-01-20 10:19:31,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:31,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-01-20 10:19:31,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,769 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-20 10:19:31,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,856 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:31,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:31,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 138 [2019-01-20 10:19:31,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:31,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:31,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-01-20 10:19:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:32,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:19:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:32,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:19:32,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:19:32,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:19:32,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:19:32,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:19:32,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:19:32,071 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-01-20 10:19:32,561 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-20 10:19:36,309 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-01-20 10:19:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:19:44,287 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-01-20 10:19:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:19:44,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:19:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:19:44,311 INFO L225 Difference]: With dead ends: 7367 [2019-01-20 10:19:44,311 INFO L226 Difference]: Without dead ends: 7366 [2019-01-20 10:19:44,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=93, Invalid=178, Unknown=1, NotChecked=0, Total=272 [2019-01-20 10:19:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-01-20 10:19:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-01-20 10:19:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-01-20 10:19:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-01-20 10:19:53,537 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-01-20 10:19:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:53,538 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-01-20 10:19:53,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:19:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-01-20 10:19:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:19:53,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:19:53,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:19:53,544 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:19:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-01-20 10:19:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:19:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:53,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:53,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:19:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:19:53,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:53,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:19:53,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:19:53,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:19:53,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:53,686 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:19:53,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:19:53,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:19:53,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:19:53,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:19:53,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:19:53,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:19:53,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:19:53,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:19:53,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:19:53,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:19:53,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:19:53,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:53,793 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:53,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:53,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:53,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:53,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:53,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:19:53,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:19:53,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:53,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:19:54,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:19:54,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:19:54,099 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,123 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,147 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,172 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,198 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:54,242 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:19:54,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:19:54,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,323 INFO L267 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-01-20 10:19:54,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:19:54,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:19:54,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,409 INFO L267 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-01-20 10:19:54,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:19:54,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,451 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:54,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:19:54,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:54,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-20 10:19:54,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:54,541 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:54,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:19:54,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:54,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:54,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-20 10:19:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:54,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:19:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:54,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:19:54,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:19:54,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:19:54,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:19:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:19:54,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:19:54,683 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-01-20 10:20:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:20:10,661 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-01-20 10:20:10,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:20:10,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:20:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:20:10,692 INFO L225 Difference]: With dead ends: 9936 [2019-01-20 10:20:10,692 INFO L226 Difference]: Without dead ends: 9935 [2019-01-20 10:20:10,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:20:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-01-20 10:20:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-01-20 10:20:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-01-20 10:20:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-01-20 10:20:24,504 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-01-20 10:20:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:20:24,504 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-01-20 10:20:24,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:20:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-01-20 10:20:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:20:24,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:20:24,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:20:24,511 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:20:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:20:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-01-20 10:20:24,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:20:24,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:20:24,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:20:24,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:20:24,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:20:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:20:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:20:24,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:20:24,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:20:24,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:20:24,626 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-01-20 10:20:24,627 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:20:24,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:20:24,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:20:24,629 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:20:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:20:24,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:20:24,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:20:24,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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:20:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:20:24,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:20:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:20:24,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:20:24,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:20:24,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:20:24,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,707 INFO L478 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 46 treesize of output 68 [2019-01-20 10:20:24,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:20:24,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:24,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:20:24,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:20:24,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:24,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:24,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:24,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:24,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:20:24,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:20:24,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:20:24,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:20:24,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:20:24,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:20:24,967 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,000 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,018 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,032 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,043 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,054 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:20:25,096 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:20:25,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:20:25,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:20:25,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:20:25,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-20 10:20:25,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,326 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:20:25,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:20:25,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,356 INFO L267 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-01-20 10:20:25,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-20 10:20:25,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:25,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:20:25,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:20:25,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:20:25,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-20 10:20:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:20:25,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:20:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:20:25,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:20:25,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:20:25,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:20:25,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:20:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:20:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:20:25,487 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-01-20 10:20:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:20:40,394 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-01-20 10:20:40,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:20:40,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:20:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:20:40,423 INFO L225 Difference]: With dead ends: 9235 [2019-01-20 10:20:40,423 INFO L226 Difference]: Without dead ends: 9232 [2019-01-20 10:20:40,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:20:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-01-20 10:20:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-01-20 10:20:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-20 10:20:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-01-20 10:20:54,622 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-01-20 10:20:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:20:54,622 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-01-20 10:20:54,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:20:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-01-20 10:20:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:20:54,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:20:54,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:20:54,630 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:20:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:20:54,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-01-20 10:20:54,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:20:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:20:54,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:20:54,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:20:54,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:20:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:20:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:20:54,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:20:54,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:20:54,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:20:54,696 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-01-20 10:20:54,697 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:20:54,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:20:54,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:20:54,699 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:20:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:20:54,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:20:54,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:20:54,699 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:20:54,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:20:54,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:20:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:20:54,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:20:54,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:20:54,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:20:54,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,787 INFO L478 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 32 treesize of output 57 [2019-01-20 10:20:54,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:54,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:20:54,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,898 INFO L478 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 21 treesize of output 24 [2019-01-20 10:20:54,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:20:54,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:20:54,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:20:54,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:20:54,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:20:54,921 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,943 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,961 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,975 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,986 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:54,997 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:20:55,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:20:55,026 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:20:55,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:55,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:20:55,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:20:55,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:20:55,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-20 10:20:55,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:55,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:55,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:55,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:20:55,297 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:20:55,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:20:55,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:20:55,318 INFO L267 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-01-20 10:20:55,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-01-20 10:20:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:20:55,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:20:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:20:55,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:20:55,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:20:55,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:20:55,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:20:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:20:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:20:55,381 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-01-20 10:21:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:21:09,102 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-01-20 10:21:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:21:09,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:21:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:21:09,131 INFO L225 Difference]: With dead ends: 9065 [2019-01-20 10:21:09,131 INFO L226 Difference]: Without dead ends: 9064 [2019-01-20 10:21:09,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:21:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-01-20 10:21:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-01-20 10:21:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-01-20 10:21:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-01-20 10:21:23,629 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-01-20 10:21:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:21:23,629 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-01-20 10:21:23,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:21:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-01-20 10:21:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:21:23,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:21:23,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:21:23,637 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:21:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:21:23,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-01-20 10:21:23,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:21:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:21:23,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:21:23,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:21:23,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:21:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:21:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:21:23,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:21:23,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:21:23,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:21:23,709 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-01-20 10:21:23,709 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:21:23,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:21:23,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:21:23,711 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:21:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:21:23,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:21:23,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:21:23,712 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:21:23,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:21:23,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:21:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:21:23,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:21:23,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:21:23,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:21:23,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:21:23,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:21:23,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:23,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:21:23,969 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:21:24,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:21:24,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:21:24,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:21:24,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:21:24,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:21:24,146 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,181 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,201 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,216 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,229 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,240 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,283 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-01-20 10:21:24,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:21:24,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:24,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-01-20 10:21:24,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:21:24,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:24,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-01-20 10:21:24,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,563 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:21:24,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:21:24,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,612 INFO L267 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-01-20 10:21:24,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-01-20 10:21:24,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,657 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:21:24,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:21:24,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:24,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-01-20 10:21:24,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:24,754 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:21:24,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 127 [2019-01-20 10:21:24,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:24,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:24,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-01-20 10:21:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:21:24,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:21:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:21:24,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:21:24,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:21:24,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:21:24,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:21:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:21:24,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:21:24,945 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-01-20 10:21:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:21:43,882 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-01-20 10:21:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:21:43,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 10:21:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:21:43,913 INFO L225 Difference]: With dead ends: 9411 [2019-01-20 10:21:43,913 INFO L226 Difference]: Without dead ends: 9409 [2019-01-20 10:21:43,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-01-20 10:21:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-01-20 10:21:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-01-20 10:21:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-01-20 10:21:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-01-20 10:21:58,041 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-01-20 10:21:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:21:58,041 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-01-20 10:21:58,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:21:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-01-20 10:21:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:21:58,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:21:58,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:21:58,050 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:21:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:21:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-01-20 10:21:58,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:21:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:21:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:21:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:21:58,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:21:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:21:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:21:58,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:21:58,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:21:58,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:21:58,206 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-01-20 10:21:58,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:21:58,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:21:58,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:21:58,209 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:21:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:21:58,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:21:58,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:21:58,210 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:21:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:21:58,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:21:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:21:58,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:21:58,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:21:58,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:21:58,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:21:58,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:21:58,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:21:58,453 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:21:58,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:21:58,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:21:58,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:21:58,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:21:58,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:21:58,604 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,638 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,658 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,673 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:58,741 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:21:58,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:21:58,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:58,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:21:58,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,874 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:21:58,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:21:58,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:58,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:58,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-01-20 10:21:58,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:58,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:21:58,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:59,007 INFO L267 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-01-20 10:21:59,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-01-20 10:21:59,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,053 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:21:59,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-20 10:21:59,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:59,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:59,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-01-20 10:21:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,146 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:21:59,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:21:59,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-20 10:21:59,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:21:59,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:21:59,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-01-20 10:21:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:21:59,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:21:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:21:59,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:21:59,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:21:59,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:21:59,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:21:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:21:59,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:21:59,321 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-01-20 10:22:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:22:15,329 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-01-20 10:22:15,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:22:15,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 10:22:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:22:15,358 INFO L225 Difference]: With dead ends: 8797 [2019-01-20 10:22:15,358 INFO L226 Difference]: Without dead ends: 8791 [2019-01-20 10:22:15,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:22:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-01-20 10:22:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-01-20 10:22:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-01-20 10:22:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-01-20 10:22:23,248 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-01-20 10:22:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:22:23,248 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-01-20 10:22:23,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:22:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-01-20 10:22:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:22:23,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:22:23,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:22:23,251 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:22:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:22:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-01-20 10:22:23,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:22:23,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:22:23,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:22:23,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:22:23,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:22:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:22:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:23,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:22:23,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:22:23,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:22:23,326 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-01-20 10:22:23,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:22:23,328 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:22:23,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:22:23,330 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:22:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:22:23,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:22:23,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:22:23,331 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:22:23,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:22:23,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:22:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:22:23,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:22:23,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:22:23,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:22:23,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,411 INFO L478 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 46 treesize of output 68 [2019-01-20 10:22:23,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:22:23,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:22:23,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,601 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:22:23,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:22:23,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:22:23,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:22:23,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:22:23,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:22:23,679 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,712 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,730 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,744 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,755 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,767 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:22:23,808 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:22:23,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:22:23,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,880 INFO L267 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-01-20 10:22:23,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:22:23,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-20 10:22:23,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:23,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:22:23,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-20 10:22:23,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:23,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:24,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:24,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:24,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:24,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:24,003 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:22:24,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 134 [2019-01-20 10:22:24,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:22:24,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:22:24,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-01-20 10:22:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:24,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:22:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:24,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:22:24,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:22:24,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:22:24,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:22:24,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:22:24,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:22:24,268 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-01-20 10:22:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:22:34,177 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-01-20 10:22:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:22:34,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:22:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:22:34,182 INFO L225 Difference]: With dead ends: 1963 [2019-01-20 10:22:34,182 INFO L226 Difference]: Without dead ends: 1962 [2019-01-20 10:22:34,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:22:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-01-20 10:22:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-01-20 10:22:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-01-20 10:22:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-01-20 10:22:42,141 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-01-20 10:22:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:22:42,141 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-01-20 10:22:42,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:22:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-01-20 10:22:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:22:42,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:22:42,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:22:42,145 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:22:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:22:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-01-20 10:22:42,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:22:42,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:22:42,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:22:42,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:22:42,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:22:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:22:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:42,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:22:42,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:22:42,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:22:42,292 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-01-20 10:22:42,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:22:42,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:22:42,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:22:42,294 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:22:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:22:42,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:22:42,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:22:42,295 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:22:42,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:22:42,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:22:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:22:42,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:22:42,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:22:42,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:22:42,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:22:42,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,351 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:22:42,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:22:42,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:22:42,369 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,396 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:22:42,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:22:42,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,528 INFO L478 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 32 treesize of output 57 [2019-01-20 10:22:42,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:22:42,573 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,587 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,601 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:22:42,646 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-20 10:22:42,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:22:42,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:22:42,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:22:42,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-20 10:22:42,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:22:42,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:22:42,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:42,784 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:22:42,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-20 10:22:42,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:42,807 INFO L267 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-01-20 10:22:42,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:22:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:42,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:22:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:42,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:22:42,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-01-20 10:22:42,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:22:42,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:22:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:22:42,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:22:42,887 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-01-20 10:22:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:22:50,933 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-01-20 10:22:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:22:50,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:22:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:22:50,939 INFO L225 Difference]: With dead ends: 2000 [2019-01-20 10:22:50,939 INFO L226 Difference]: Without dead ends: 1999 [2019-01-20 10:22:50,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:22:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-01-20 10:22:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1945. [2019-01-20 10:22:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-01-20 10:22:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 13387 transitions. [2019-01-20 10:22:58,933 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 13387 transitions. Word has length 7 [2019-01-20 10:22:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:22:58,933 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 13387 transitions. [2019-01-20 10:22:58,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:22:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 13387 transitions. [2019-01-20 10:22:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:22:58,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:22:58,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:22:58,936 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:22:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:22:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-01-20 10:22:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:22:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:22:58,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:22:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:22:58,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:22:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:22:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:58,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:22:58,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:22:58,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:22:58,955 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [30], [32], [34], [35] [2019-01-20 10:22:58,955 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:22:58,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:22:58,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:22:58,956 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:22:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:22:58,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:22:58,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:22:58,957 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:22:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:22:58,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:22:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:22:58,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:22:58,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:22:58,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:22:58,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:22:58,995 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-20 10:22:59,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-01-20 10:22:59,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-20 10:22:59,027 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,048 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:22:59,091 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-01-20 10:22:59,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:22:59,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-20 10:22:59,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:22:59,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:22:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:59,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:22:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:22:59,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:22:59,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-20 10:22:59,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:22:59,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:22:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:22:59,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:22:59,124 INFO L87 Difference]: Start difference. First operand 1945 states and 13387 transitions. Second operand 4 states. [2019-01-20 10:23:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:10,398 INFO L93 Difference]: Finished difference Result 3175 states and 21705 transitions. [2019-01-20 10:23:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:23:10,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-20 10:23:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:10,406 INFO L225 Difference]: With dead ends: 3175 [2019-01-20 10:23:10,407 INFO L226 Difference]: Without dead ends: 3170 [2019-01-20 10:23:10,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:23:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-01-20 10:23:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3133. [2019-01-20 10:23:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-01-20 10:23:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-01-20 10:23:22,416 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-01-20 10:23:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:22,416 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-01-20 10:23:22,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:23:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-01-20 10:23:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:23:22,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:22,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:23:22,420 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:22,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-01-20 10:23:22,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:22,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:22,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:22,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-01-20 10:23:22,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:22,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:22,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:23:22,460 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [30], [32], [33] [2019-01-20 10:23:22,461 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:23:22,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:23:22,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:23:22,463 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:23:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:22,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:23:22,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:22,464 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:22,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:22,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:22,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:22,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:23:22,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:23:22,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:23:22,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,510 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:23:22,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:23:22,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:23:22,531 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,557 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:23:22,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:23:22,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,690 INFO L478 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 32 treesize of output 57 [2019-01-20 10:23:22,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:23:22,735 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,749 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,763 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,779 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:23:22,808 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:23:22,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:23:22,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:23:22,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:23:22,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:22,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:23:22,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:23:22,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:22,903 INFO L267 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-01-20 10:23:22,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-20 10:23:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:22,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:22,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:22,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:23:22,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:22,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:23:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:23:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:23:22,958 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states. [2019-01-20 10:23:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:34,565 INFO L93 Difference]: Finished difference Result 3149 states and 21664 transitions. [2019-01-20 10:23:34,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:23:34,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:23:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:34,574 INFO L225 Difference]: With dead ends: 3149 [2019-01-20 10:23:34,574 INFO L226 Difference]: Without dead ends: 3148 [2019-01-20 10:23:34,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:23:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2019-01-20 10:23:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3133. [2019-01-20 10:23:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-01-20 10:23:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-01-20 10:23:46,728 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-01-20 10:23:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:46,728 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-01-20 10:23:46,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:23:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-01-20 10:23:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:23:46,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:46,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:23:46,733 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1858652208, now seen corresponding path program 1 times [2019-01-20 10:23:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:46,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:46,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:46,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:46,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:23:46,852 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [32], [33] [2019-01-20 10:23:46,853 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:23:46,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:23:46,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:23:46,855 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:23:46,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:46,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:23:46,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:46,856 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:46,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:46,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:46,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:46,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:23:46,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:23:46,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:23:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,892 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:23:46,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:23:46,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:46,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:23:46,911 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:46,946 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:46,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:46,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:46,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:23:47,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:23:47,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,094 INFO L478 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 46 treesize of output 68 [2019-01-20 10:23:47,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:23:47,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:23:47,213 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,234 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,256 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,280 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,305 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:23:47,346 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:23:47,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:23:47,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:47,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:23:47,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:23:47,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:23:47,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:23:47,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:23:47,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:23:47,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:106 [2019-01-20 10:23:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:47,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:47,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:47,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:23:47,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:47,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:23:47,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:23:47,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:23:47,679 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states.