java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:14:48,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:14:48,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:14:48,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:14:48,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:14:48,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:14:48,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:14:48,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:14:48,715 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:14:48,716 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:14:48,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:14:48,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:14:48,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:14:48,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:14:48,723 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:14:48,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:14:48,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:14:48,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:14:48,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:14:48,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:14:48,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:14:48,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:14:48,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:14:48,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:14:48,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:14:48,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:14:48,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:14:48,761 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:14:48,762 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:14:48,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:14:48,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:14:48,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:14:48,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:14:48,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:14:48,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:14:48,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:14:48,768 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-11 14:14:48,787 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:14:48,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:14:48,789 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:14:48,789 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:14:48,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:14:48,789 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:14:48,789 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:14:48,790 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:14:48,790 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:14:48,790 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:14:48,790 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:14:48,790 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:14:48,791 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:14:48,791 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:14:48,792 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:14:48,792 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:14:48,792 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:14:48,792 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:14:48,793 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:14:48,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:14:48,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:14:48,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:14:48,793 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:14:48,794 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:14:48,794 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:14:48,794 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:14:48,794 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:14:48,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:14:48,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:14:48,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:14:48,795 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:14:48,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:14:48,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:14:48,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:14:48,796 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:14:48,796 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:14:48,796 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:14:48,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:14:48,797 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:14:48,797 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:14:48,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:14:48,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:14:48,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:14:48,862 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:14:48,862 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:14:48,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2019-01-11 14:14:48,863 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-01-11 14:14:48,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:14:48,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:14:48,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:14:48,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:14:48,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:14:48,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,940 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 14:14:48,940 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 14:14:48,940 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 14:14:48,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:14:48,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:14:48,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:14:48,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:14:48,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/1) ... [2019-01-11 14:14:48,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:14:48,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:14:48,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:14:48,972 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:14:48,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:14:49,039 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-11 14:14:49,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 14:14:49,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 14:14:49,233 INFO L278 CfgBuilder]: Using library mode [2019-01-11 14:14:49,234 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-11 14:14:49,235 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:14:49 BoogieIcfgContainer [2019-01-11 14:14:49,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:14:49,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:14:49,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:14:49,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:14:49,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:14:48" (1/2) ... [2019-01-11 14:14:49,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208283b7 and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:14:49, skipping insertion in model container [2019-01-11 14:14:49,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:14:49" (2/2) ... [2019-01-11 14:14:49,245 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-01-11 14:14:49,259 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:14:49,268 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:14:49,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:14:49,324 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:14:49,324 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:14:49,324 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:14:49,325 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:14:49,325 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:14:49,325 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:14:49,325 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:14:49,325 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:14:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-11 14:14:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:14:49,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:49,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:14:49,367 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:49,374 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-01-11 14:14:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:49,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:49,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:49,701 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-01-11 14:14:49,736 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-11 14:14:49,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:14:49,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:14:49,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:14:49,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:14:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:14:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:14:49,759 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-11 14:14:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:49,827 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-11 14:14:49,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:14:49,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:14:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:49,843 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:14:49,843 INFO L226 Difference]: Without dead ends: 5 [2019-01-11 14:14:49,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:14:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-11 14:14:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-11 14:14:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-11 14:14:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-11 14:14:49,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-11 14:14:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:49,875 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-11 14:14:49,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:14:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-11 14:14:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:14:49,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:49,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:14:49,877 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-01-11 14:14:49,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:49,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:49,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:50,245 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-11 14:14:50,266 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-11 14:14:50,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:50,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:50,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:14:50,270 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-01-11 14:14:50,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:14:50,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:14:50,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:14:50,390 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 22 root evaluator evaluations with a maximum evaluation depth of 3. Performed 22 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:14:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:50,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:14:50,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:50,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:14:50,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:50,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:14:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:50,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:50,487 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 9 treesize of output 12 [2019-01-11 14:14:50,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:50,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:50,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-11 14:14:50,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:50,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:50,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:50,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-11 14:14:50,871 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-11 14:14:50,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:50,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:50,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:50,977 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 4 case distinctions, treesize of input 34 treesize of output 58 [2019-01-11 14:14:51,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,092 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-11 14:14:51,107 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 1 case distinctions, treesize of input 50 treesize of output 70 [2019-01-11 14:14:51,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:51,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,339 INFO L303 Elim1Store]: Index analysis took 111 ms [2019-01-11 14:14:51,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 90 [2019-01-11 14:14:51,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:51,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:14:51,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,497 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 2 case distinctions, treesize of input 33 treesize of output 57 [2019-01-11 14:14:51,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2019-01-11 14:14:51,519 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:51,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:51,921 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-01-11 14:14:51,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 86 [2019-01-11 14:14:51,923 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:51,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:14:52,058 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 4 xjuncts. [2019-01-11 14:14:52,059 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2019-01-11 14:14:52,212 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-11 14:14:52,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:52,290 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-11 14:14:52,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:52,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-11 14:14:52,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:52,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:14:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:14:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:14:52,312 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-11 14:14:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:56,394 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-11 14:14:56,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:14:56,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:14:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:56,395 INFO L225 Difference]: With dead ends: 8 [2019-01-11 14:14:56,395 INFO L226 Difference]: Without dead ends: 6 [2019-01-11 14:14:56,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:14:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-11 14:14:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-11 14:14:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 14:14:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-11 14:14:56,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-11 14:14:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:56,401 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-11 14:14:56,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:14:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-11 14:14:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:14:56,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:56,401 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:14:56,402 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-01-11 14:14:56,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:56,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:56,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:56,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:56,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:56,667 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2019-01-11 14:14:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:14:56,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:56,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:56,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:56,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:56,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:56,722 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-11 14:14:56,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:56,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:56,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:14:56,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:56,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:56,761 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 9 treesize of output 12 [2019-01-11 14:14:56,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:56,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:56,769 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-11 14:14:56,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:56,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:56,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:56,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-11 14:14:56,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:56,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:56,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:56,981 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-11 14:14:57,024 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 2 case distinctions, treesize of input 29 treesize of output 53 [2019-01-11 14:14:57,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 66 [2019-01-11 14:14:57,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:57,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-11 14:14:57,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:57,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:14:57,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,264 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 4 case distinctions, treesize of input 30 treesize of output 54 [2019-01-11 14:14:57,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2019-01-11 14:14:57,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:57,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,372 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 1 case distinctions, treesize of input 30 treesize of output 46 [2019-01-11 14:14:57,373 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:57,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:14:57,476 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 4 xjuncts. [2019-01-11 14:14:57,477 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-01-11 14:14:57,768 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-11 14:14:57,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,806 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 2 case distinctions, treesize of input 54 treesize of output 72 [2019-01-11 14:14:57,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 14:14:57,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:57,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:57,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,943 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 71 [2019-01-11 14:14:57,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:57,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 93 [2019-01-11 14:14:57,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:58,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:58,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 122 [2019-01-11 14:14:58,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,425 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 167 [2019-01-11 14:14:58,426 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:58,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:58,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 125 [2019-01-11 14:14:58,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:14:58,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 164 [2019-01-11 14:14:58,568 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:58,689 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:14:58,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-11 14:14:58,831 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2019-01-11 14:14:59,084 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-11 14:14:59,089 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-11 14:14:59,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:59,165 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-11 14:14:59,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:59,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-11 14:14:59,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:59,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:14:59,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:14:59,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:14:59,185 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-01-11 14:15:03,989 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-01-11 14:15:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:08,488 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-11 14:15:08,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:15:08,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:15:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:08,489 INFO L225 Difference]: With dead ends: 10 [2019-01-11 14:15:08,489 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 14:15:08,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:15:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 14:15:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-11 14:15:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:15:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-11 14:15:08,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-11 14:15:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:08,494 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-11 14:15:08,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:15:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-11 14:15:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:15:08,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:08,495 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-11 14:15:08,495 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-01-11 14:15:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:08,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:08,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:08,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:08,821 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-01-11 14:15:09,037 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-01-11 14:15:09,096 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-11 14:15:09,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:09,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:09,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:09,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:09,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:09,097 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-11 14:15:09,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:15:09,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:15:09,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:15:09,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:09,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:09,256 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 9 treesize of output 12 [2019-01-11 14:15:09,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-11 14:15:09,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:09,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:09,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:09,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-11 14:15:09,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,357 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 33 treesize of output 50 [2019-01-11 14:15:09,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-11 14:15:09,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:09,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:09,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-11 14:15:09,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:09,687 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-11 14:15:09,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:09,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:09,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:15:09,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-11 14:15:10,032 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-11 14:15:10,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-11 14:15:10,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,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, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-11 14:15:10,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:10,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:10,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:15:10,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,344 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 72 treesize of output 148 [2019-01-11 14:15:10,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:10,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 136 [2019-01-11 14:15:10,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:10,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:10,541 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 2 xjuncts. [2019-01-11 14:15:10,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-11 14:15:11,464 WARN L181 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-11 14:15:11,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,477 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 95 treesize of output 161 [2019-01-11 14:15:11,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:11,492 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 159 [2019-01-11 14:15:11,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:11,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:12,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,887 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:15:12,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,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, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 270 [2019-01-11 14:15:12,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:12,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 192 [2019-01-11 14:15:12,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:13,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:13,241 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 2 xjuncts. [2019-01-11 14:15:13,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2019-01-11 14:15:13,938 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-11 14:15:18,912 WARN L181 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-01-11 14:15:18,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,970 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 134 treesize of output 296 [2019-01-11 14:15:18,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:18,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 83 treesize of output 212 [2019-01-11 14:15:18,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:19,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:20,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:20,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:21,000 INFO L303 Elim1Store]: Index analysis took 348 ms [2019-01-11 14:15:21,001 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 394 [2019-01-11 14:15:21,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:21,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:21,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:21,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:21,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:21,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:15:21,166 INFO L303 Elim1Store]: Index analysis took 162 ms [2019-01-11 14:15:21,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 319 [2019-01-11 14:15:21,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:21,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:15:21,758 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 2 xjuncts. [2019-01-11 14:15:21,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2019-01-11 14:15:31,821 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 67 [2019-01-11 14:15:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:31,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:15:37,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:37,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-01-11 14:15:37,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:37,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:15:37,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:15:37,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=134, Unknown=3, NotChecked=0, Total=210 [2019-01-11 14:15:37,904 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-01-11 14:15:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:59,392 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-11 14:15:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:15:59,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:15:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:59,393 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:15:59,393 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:15:59,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=73, Invalid=134, Unknown=3, NotChecked=0, Total=210 [2019-01-11 14:15:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:15:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 14:15:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:15:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-11 14:15:59,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-01-11 14:15:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:59,398 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-11 14:15:59,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:15:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-11 14:15:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 14:15:59,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:59,399 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-11 14:15:59,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2019-01-11 14:15:59,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:59,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:59,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:59,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:59,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:59,856 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 15 [2019-01-11 14:16:00,195 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-01-11 14:16:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-11 14:16:00,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:00,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:00,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:00,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:00,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:00,365 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-11 14:16:00,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:00,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:16:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:02,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:02,448 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 9 treesize of output 12 [2019-01-11 14:16:02,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,461 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-11 14:16:02,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-11 14:16:02,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,525 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 33 treesize of output 50 [2019-01-11 14:16:02,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-11 14:16:02,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-11 14:16:02,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,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, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-11 14:16:02,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:16:02,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-11 14:16:02,844 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-11 14:16:02,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-11 14:16:02,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:02,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-11 14:16:02,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:02,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:03,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,020 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:16:03,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,039 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 72 treesize of output 130 [2019-01-11 14:16:03,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:03,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, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 126 [2019-01-11 14:16:03,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:03,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:03,193 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 2 xjuncts. [2019-01-11 14:16:03,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-11 14:16:04,087 WARN L181 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-01-11 14:16:04,093 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:16:04,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,164 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:16:04,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,190 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 259 [2019-01-11 14:16:04,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 178 [2019-01-11 14:16:04,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:04,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:04,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,491 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 95 treesize of output 171 [2019-01-11 14:16:04,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:04,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 127 [2019-01-11 14:16:04,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:04,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:04,753 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 2 xjuncts. [2019-01-11 14:16:04,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2019-01-11 14:16:06,002 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-11 14:16:08,314 WARN L181 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-11 14:16:08,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,341 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 136 treesize of output 298 [2019-01-11 14:16:08,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:08,359 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 85 treesize of output 214 [2019-01-11 14:16:08,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:08,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:10,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:10,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:10,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:10,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,271 INFO L303 Elim1Store]: Index analysis took 426 ms [2019-01-11 14:16:11,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 378 [2019-01-11 14:16:11,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:11,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 287 [2019-01-11 14:16:11,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:11,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:12,113 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 2 xjuncts. [2019-01-11 14:16:12,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2019-01-11 14:16:20,098 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-11 14:16:30,012 WARN L181 SmtUtils]: Spent 9.91 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-11 14:16:30,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,176 INFO L303 Elim1Store]: Index analysis took 162 ms [2019-01-11 14:16:30,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 491 [2019-01-11 14:16:30,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:30,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 367 [2019-01-11 14:16:30,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:30,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:34,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:34,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,100 INFO L303 Elim1Store]: Index analysis took 911 ms [2019-01-11 14:16:35,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 585 [2019-01-11 14:16:35,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:16:35,223 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-11 14:16:35,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 450 [2019-01-11 14:16:35,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:37,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:16:38,505 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 2 xjuncts. [2019-01-11 14:16:38,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2019-01-11 14:16:54,126 WARN L181 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 72 [2019-01-11 14:17:09,982 WARN L181 SmtUtils]: Spent 15.85 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-01-11 14:17:10,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:10,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:11,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,149 INFO L303 Elim1Store]: Index analysis took 2165 ms [2019-01-11 14:17:12,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 876 [2019-01-11 14:17:12,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:12,323 INFO L303 Elim1Store]: Index analysis took 168 ms [2019-01-11 14:17:12,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 713 [2019-01-11 14:17:12,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:17:18,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:17:38,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,170 INFO L303 Elim1Store]: Index analysis took 176 ms [2019-01-11 14:17:38,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 746 [2019-01-11 14:17:38,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:17:38,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 574 [2019-01-11 14:17:38,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:17:38,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:17:41,893 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 2 xjuncts. [2019-01-11 14:17:41,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:547, output treesize:445 [2019-01-11 14:18:11,296 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 81 [2019-01-11 14:18:27,004 WARN L181 SmtUtils]: Spent 15.70 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-11 14:18:27,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:27,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:28,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:29,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:29,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,138 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) (mod v_subst_4 256)) [2019-01-11 14:18:31,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:31,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,905 INFO L303 Elim1Store]: Index analysis took 5899 ms [2019-01-11 14:18:32,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 1173 [2019-01-11 14:18:32,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:18:32,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 1238 [2019-01-11 14:18:32,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:18:37,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:19:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:13,983 INFO L303 Elim1Store]: Index analysis took 267 ms [2019-01-11 14:19:13,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 1091 [2019-01-11 14:19:14,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:14,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 863 [2019-01-11 14:19:14,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:19:14,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:19:20,103 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 2 xjuncts. [2019-01-11 14:19:20,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:689, output treesize:557 [2019-01-11 14:19:22,112 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_subst_4 Int)) (let ((.cse4 (mod (+ v_subst_4 1) 256))) (let ((.cse9 (mod (+ .cse4 1) 256))) (let ((.cse2 (mod (+ .cse9 1) 256))) (let ((.cse8 (mod (+ .cse2 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse3 (select c_main_a .cse9)) (.cse5 (select c_main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse7 1) 256)) (.cse6 (select c_main_a .cse8)) (.cse1 (select c_main_a .cse7))) (and (= (select c_main_a .cse0) .cse1) (= (select c_main_a .cse2) .cse3) (= (select c_main_a .cse4) .cse3) (= 1000 .cse3) (= 0 (select c_main_a v_subst_4)) (= 1000 .cse5) (= c_main_x .cse0) (= .cse6 1000) (= (select c_main_a c_main_y) .cse1) (= (select c_main_a (mod v_subst_4 256)) .cse5) (= c_main_y (mod (+ .cse0 1) 256)) (= .cse6 .cse1))))))))) (exists ((v_subst_5 Int)) (let ((.cse17 (mod (+ v_subst_5 1) 256))) (let ((.cse16 (mod (+ .cse17 1) 256))) (let ((.cse20 (mod (+ .cse16 1) 256))) (let ((.cse18 (mod (+ .cse20 1) 256))) (let ((.cse19 (mod (+ .cse18 1) 256))) (let ((.cse12 (select c_main_a v_subst_5)) (.cse14 (mod (+ .cse19 1) 256)) (.cse11 (select c_main_a .cse20)) (.cse15 (select c_main_a .cse19)) (.cse10 (select c_main_a .cse18)) (.cse13 (select c_main_a .cse17))) (and (= 1000 .cse10) (= .cse11 .cse10) (= .cse12 .cse13) (= .cse12 (select c_main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse14 1) 256) c_main_y) (= c_main_x .cse14) (= .cse15 (select c_main_a c_main_x)) (= .cse11 (select c_main_a .cse16)) (= .cse15 (select c_main_a c_main_y)) (= .cse15 .cse10) (= v_subst_5 (mod v_subst_5 256)) (= .cse13 1000)))))))))) is different from false [2019-01-11 14:20:00,954 WARN L181 SmtUtils]: Spent 38.83 s on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-01-11 14:20:01,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:03,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:04,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:04,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:04,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:04,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:04,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:05,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:05,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:05,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:05,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:05,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:06,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:06,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:06,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:06,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:06,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:07,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:07,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:07,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:07,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:07,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:07,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:08,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:08,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:08,987 INFO L303 Elim1Store]: Index analysis took 8031 ms [2019-01-11 14:20:08,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 1732 [2019-01-11 14:20:09,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:09,295 INFO L303 Elim1Store]: Index analysis took 301 ms [2019-01-11 14:20:09,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 57 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 1417 [2019-01-11 14:20:09,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:20,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,893 INFO L303 Elim1Store]: Index analysis took 787 ms [2019-01-11 14:20:55,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 1540 [2019-01-11 14:20:55,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 1248 [2019-01-11 14:20:55,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:01,792 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 2 xjuncts. [2019-01-11 14:21:01,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:841, output treesize:653 [2019-01-11 14:21:03,807 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_subst_4 Int)) (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse6 1) 256))) (let ((.cse4 (mod (+ .cse8 1) 256))) (let ((.cse3 (mod (+ .cse4 1) 256))) (let ((.cse9 (mod (+ .cse3 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse0 (mod (+ .cse10 1) 256)) (.cse1 (select c_main_a .cse10)) (.cse2 (select c_main_a .cse9)) (.cse5 (select c_main_a .cse8)) (.cse7 (select c_main_a (+ v_subst_4 (- 1))))) (and (= c_main_y (mod (+ .cse0 1) 256)) (= c_main_x .cse0) (= (select c_main_a c_main_y) .cse1) (= 1000 .cse2) (= (select c_main_a c_main_x) .cse1) (= (select c_main_a .cse3) .cse2) (= .cse1 .cse2) (= (select c_main_a .cse4) .cse5) (= (select c_main_a .cse6) .cse5) (= 1000 .cse5) (= 0 (select c_main_a v_subst_4)) (= 1000 .cse7) (= (select c_main_a (mod v_subst_4 256)) .cse7)))))))))) (exists ((v_subst_5 Int)) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse20 (mod (+ .cse18 1) 256))) (let ((.cse23 (mod (+ .cse20 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse22 1) 256))) (let ((.cse11 (select c_main_a .cse23)) (.cse14 (mod (+ .cse21 1) 256)) (.cse16 (select c_main_a .cse22)) (.cse12 (select c_main_a .cse21)) (.cse15 (select c_main_a v_subst_5)) (.cse13 (select c_main_a .cse20)) (.cse17 (select c_main_a .cse19))) (and (= 1000 .cse11) (= (select c_main_a c_main_y) .cse12) (= (select c_main_a c_main_x) .cse12) (= .cse13 .cse11) (= .cse14 c_main_x) (= .cse15 (select c_main_a (+ v_subst_5 (- 1)))) (= .cse16 1000) (= c_main_y (mod (+ .cse14 1) 256)) (= .cse16 .cse12) (= .cse15 .cse17) (= .cse13 (select c_main_a .cse18)) (= v_subst_5 (mod v_subst_5 256)) (= .cse17 1000))))))))))) is different from false [2019-01-11 14:21:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 7 times theorem prover too weak. 0 trivial. 15 not checked. [2019-01-11 14:21:03,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 14:21:11,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:11,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 4] total 19 [2019-01-11 14:21:11,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:11,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 14:21:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 14:21:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=184, Unknown=23, NotChecked=66, Total=380 [2019-01-11 14:21:11,193 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-01-11 14:22:26,157 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select c_main_a c_main_y))) (and (= (select c_main_a c_main_x) .cse0) (or (exists ((v_subst_4 Int)) (let ((.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse5 1) 256))) (let ((.cse3 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse3 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse4 (select c_main_a .cse10)) (.cse6 (select c_main_a (+ v_subst_4 (- 1)))) (.cse1 (mod (+ .cse8 1) 256)) (.cse7 (select c_main_a .cse9)) (.cse2 (select c_main_a .cse8))) (and (= (select c_main_a .cse1) .cse2) (= (select c_main_a .cse3) .cse4) (= (select c_main_a .cse5) .cse4) (= 1000 .cse4) (= 0 (select c_main_a v_subst_4)) (= 1000 .cse6) (= c_main_x .cse1) (= .cse7 1000) (= (select c_main_a c_main_y) .cse2) (= (select c_main_a (mod v_subst_4 256)) .cse6) (= c_main_y (mod (+ .cse1 1) 256)) (= .cse7 .cse2))))))))) (exists ((v_subst_5 Int)) (let ((.cse18 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse21 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse21 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse13 (select c_main_a v_subst_5)) (.cse15 (mod (+ .cse20 1) 256)) (.cse12 (select c_main_a .cse21)) (.cse16 (select c_main_a .cse20)) (.cse11 (select c_main_a .cse19)) (.cse14 (select c_main_a .cse18))) (and (= 1000 .cse11) (= .cse12 .cse11) (= .cse13 .cse14) (= .cse13 (select c_main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse15 1) 256) c_main_y) (= c_main_x .cse15) (= .cse16 (select c_main_a c_main_x)) (= .cse12 (select c_main_a .cse17)) (= .cse16 (select c_main_a c_main_y)) (= .cse16 .cse11) (= v_subst_5 (mod v_subst_5 256)) (= .cse14 1000)))))))))) (not (= 0 .cse0)))) is different from false [2019-01-11 14:22:28,173 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select c_main_a c_main_y))) (and (= (select c_main_a c_main_x) .cse0) (or (exists ((v_subst_4 Int)) (let ((.cse7 (mod (+ v_subst_4 1) 256))) (let ((.cse9 (mod (+ .cse7 1) 256))) (let ((.cse5 (mod (+ .cse9 1) 256))) (let ((.cse4 (mod (+ .cse5 1) 256))) (let ((.cse10 (mod (+ .cse4 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse1 (mod (+ .cse11 1) 256)) (.cse2 (select c_main_a .cse11)) (.cse3 (select c_main_a .cse10)) (.cse6 (select c_main_a .cse9)) (.cse8 (select c_main_a (+ v_subst_4 (- 1))))) (and (= c_main_y (mod (+ .cse1 1) 256)) (= c_main_x .cse1) (= (select c_main_a c_main_y) .cse2) (= 1000 .cse3) (= (select c_main_a c_main_x) .cse2) (= (select c_main_a .cse4) .cse3) (= .cse2 .cse3) (= (select c_main_a .cse5) .cse6) (= (select c_main_a .cse7) .cse6) (= 1000 .cse6) (= 0 (select c_main_a v_subst_4)) (= 1000 .cse8) (= (select c_main_a (mod v_subst_4 256)) .cse8)))))))))) (exists ((v_subst_5 Int)) (let ((.cse20 (mod (+ v_subst_5 1) 256))) (let ((.cse19 (mod (+ .cse20 1) 256))) (let ((.cse21 (mod (+ .cse19 1) 256))) (let ((.cse24 (mod (+ .cse21 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse12 (select c_main_a .cse24)) (.cse15 (mod (+ .cse22 1) 256)) (.cse17 (select c_main_a .cse23)) (.cse13 (select c_main_a .cse22)) (.cse16 (select c_main_a v_subst_5)) (.cse14 (select c_main_a .cse21)) (.cse18 (select c_main_a .cse20))) (and (= 1000 .cse12) (= (select c_main_a c_main_y) .cse13) (= (select c_main_a c_main_x) .cse13) (= .cse14 .cse12) (= .cse15 c_main_x) (= .cse16 (select c_main_a (+ v_subst_5 (- 1)))) (= .cse17 1000) (= c_main_y (mod (+ .cse15 1) 256)) (= .cse17 .cse13) (= .cse16 .cse18) (= .cse14 (select c_main_a .cse19)) (= v_subst_5 (mod v_subst_5 256)) (= .cse18 1000))))))))))) (not (= 0 .cse0)))) is different from false [2019-01-11 14:22:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:28,177 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-11 14:22:28,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:22:28,177 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-11 14:22:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:28,178 INFO L225 Difference]: With dead ends: 13 [2019-01-11 14:22:28,178 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:22:28,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 70.4s TimeCoverageRelationStatistics Valid=111, Invalid=186, Unknown=25, NotChecked=140, Total=462 [2019-01-11 14:22:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:22:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:22:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:22:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:22:28,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-11 14:22:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:28,180 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:22:28,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 14:22:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:22:28,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:22:28,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:22:31,174 WARN L181 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 329 DAG size of output: 35 [2019-01-11 14:22:31,178 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 9 30) no Hoare annotation was computed. [2019-01-11 14:22:31,178 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-11 14:22:31,178 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 9 30) no Hoare annotation was computed. [2019-01-11 14:22:31,178 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 28) no Hoare annotation was computed. [2019-01-11 14:22:31,178 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 30) no Hoare annotation was computed. [2019-01-11 14:22:31,179 INFO L444 ceAbstractionStarter]: At program point L18-1(lines 18 29) the Hoare annotation is: (let ((.cse0 (select main_a main_x)) (.cse1 (select main_a main_y))) (or (and (= .cse0 1000) (= .cse1 0) (= main_y (+ main_x 1))) (and (= .cse0 .cse1) (not (= 0 .cse1))) (exists ((main_yold Int)) (let ((.cse2 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse2) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) .cse2) (= (select main_a main_x) .cse3) (= 1000 .cse3)))))) [2019-01-11 14:22:31,190 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:22:31 BoogieIcfgContainer [2019-01-11 14:22:31,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:22:31,192 INFO L168 Benchmark]: Toolchain (without parser) took 462289.06 ms. Allocated memory was 136.8 MB in the beginning and 392.7 MB in the end (delta: 255.9 MB). Free memory was 104.5 MB in the beginning and 372.1 MB in the end (delta: -267.6 MB). Peak memory consumption was 308.2 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:31,192 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:22:31,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.88 ms. Allocated memory is still 136.8 MB. Free memory was 104.3 MB in the beginning and 102.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:31,193 INFO L168 Benchmark]: Boogie Preprocessor took 27.27 ms. Allocated memory is still 136.8 MB. Free memory was 102.5 MB in the beginning and 101.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:31,193 INFO L168 Benchmark]: RCFGBuilder took 263.87 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 92.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:31,194 INFO L168 Benchmark]: TraceAbstraction took 461953.49 ms. Allocated memory was 136.8 MB in the beginning and 392.7 MB in the end (delta: 255.9 MB). Free memory was 92.1 MB in the beginning and 372.1 MB in the end (delta: -279.9 MB). Peak memory consumption was 295.9 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:31,196 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.88 ms. Allocated memory is still 136.8 MB. Free memory was 104.3 MB in the beginning and 102.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.27 ms. Allocated memory is still 136.8 MB. Free memory was 102.5 MB in the beginning and 101.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 263.87 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 92.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 461953.49 ms. Allocated memory was 136.8 MB in the beginning and 392.7 MB in the end (delta: 255.9 MB). Free memory was 92.1 MB in the beginning and 372.1 MB in the end (delta: -279.9 MB). Peak memory consumption was 295.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((a[x] == 1000 && a[y] == 0) && y == x + 1) || (a[x] == a[y] && !(0 == a[y]))) || (exists main_yold : int :: ((((main_yold % 256 == x && 0 == a[main_yold]) && y == (main_yold + 1) % 256) && a[y] == a[main_yold]) && a[x] == a[main_yold + -1]) && 1000 == a[main_yold + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 461.8s OverallTime, 5 OverallIterations, 8 TraceHistogramMax, 111.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 82 SolverSat, 9 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 106.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 89.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 73 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1247 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 2234 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 343.9s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 18 QuantifiedInterpolants, 58064 SizeOfPredicates, 38 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 32/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...