java -ea -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-1de736e-m [2019-02-14 16:20:53,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:20:53,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:20:53,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:20:53,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:20:53,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:20:53,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:20:53,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:20:53,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:20:53,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:20:53,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:20:53,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:20:53,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:20:53,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:20:53,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:20:53,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:20:53,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:20:53,657 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:20:53,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:20:53,661 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:20:53,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:20:53,663 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:20:53,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:20:53,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:20:53,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:20:53,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:20:53,668 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:20:53,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:20:53,670 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:20:53,671 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:20:53,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:20:53,672 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:20:53,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:20:53,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:20:53,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:20:53,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:20:53,675 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-14 16:20:53,687 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:20:53,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:20:53,688 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:20:53,689 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:20:53,689 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:20:53,689 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:20:53,689 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:20:53,689 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:20:53,690 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-14 16:20:53,690 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:20:53,690 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-14 16:20:53,690 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-14 16:20:53,691 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:20:53,691 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:20:53,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:20:53,692 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:20:53,692 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:20:53,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:20:53,692 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:20:53,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:20:53,693 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:20:53,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:20:53,693 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:20:53,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:20:53,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:20:53,694 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:20:53,694 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:20:53,694 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:20:53,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:20:53,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:20:53,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:20:53,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:20:53,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:20:53,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:20:53,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:20:53,696 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:20:53,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:20:53,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:20:53,696 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:20:53,696 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:20:53,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:20:53,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:20:53,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:20:53,742 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:20:53,742 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:20:53,743 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-02-14 16:20:53,743 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-02-14 16:20:53,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:20:53,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:20:53,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:20:53,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:20:53,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:20:53,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,811 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-14 16:20:53,812 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-14 16:20:53,812 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-14 16:20:53,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:20:53,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:20:53,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:20:53,816 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:20:53,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... [2019-02-14 16:20:53,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:20:53,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:20:53,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:20:53,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:20:53,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:20:53,920 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-14 16:20:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-14 16:20:53,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-14 16:20:54,196 INFO L278 CfgBuilder]: Using library mode [2019-02-14 16:20:54,197 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-14 16:20:54,198 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:20:54 BoogieIcfgContainer [2019-02-14 16:20:54,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:20:54,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:20:54,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:20:54,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:20:54,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:20:53" (1/2) ... [2019-02-14 16:20:54,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf181f6 and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:20:54, skipping insertion in model container [2019-02-14 16:20:54,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:20:54" (2/2) ... [2019-02-14 16:20:54,206 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-02-14 16:20:54,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:20:54,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:20:54,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:20:54,271 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:20:54,271 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:20:54,272 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:20:54,272 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:20:54,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:20:54,272 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:20:54,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:20:54,273 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:20:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-14 16:20:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:20:54,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:20:54,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:20:54,313 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:20:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:20:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-02-14 16:20:54,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:20:54,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:20:54,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:20:54,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:20:54,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:20:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:20:54,788 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} is VALID [2019-02-14 16:20:54,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} assume a[x] == 0; {12#(= (select main_a main_y) 1000)} is VALID [2019-02-14 16:20:54,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-02-14 16:20:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:20:54,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:20:54,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:20:54,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:20:54,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:20:54,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:20:54,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:20:54,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:20:54,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:20:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:20:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:20:54,850 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-14 16:20:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:20:55,037 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-14 16:20:55,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:20:55,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:20:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:20:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:20:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-02-14 16:20:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:20:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-02-14 16:20:55,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-02-14 16:20:55,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:20:55,208 INFO L225 Difference]: With dead ends: 15 [2019-02-14 16:20:55,208 INFO L226 Difference]: Without dead ends: 5 [2019-02-14 16:20:55,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:20:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-14 16:20:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-14 16:20:55,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:20:55,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-14 16:20:55,293 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-14 16:20:55,294 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-14 16:20:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:20:55,295 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-14 16:20:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:20:55,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:20:55,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:20:55,296 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-14 16:20:55,296 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-14 16:20:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:20:55,298 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-14 16:20:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:20:55,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:20:55,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:20:55,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:20:55,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:20:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-14 16:20:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-14 16:20:55,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-14 16:20:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:20:55,302 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-14 16:20:55,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:20:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:20:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:20:55,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:20:55,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:20:55,304 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:20:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:20:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-02-14 16:20:55,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:20:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:20:55,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:20:55,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:20:55,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:20:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:20:55,767 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-02-14 16:20:55,813 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} is VALID [2019-02-14 16:20:55,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {52#(= (select main_a main_x) 1000)} is VALID [2019-02-14 16:20:55,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-02-14 16:20:55,838 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-14 16:20:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:20:55,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:20:55,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:20:55,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:20:55,843 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-02-14 16:20:55,884 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:20:55,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:20:56,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:20:56,007 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-02-14 16:20:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:20:56,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:20:56,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:20:56,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:20:56,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:20:56,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:20:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:20:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:20:56,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:20:56,158 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-02-14 16:20:56,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:56,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:56,240 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-02-14 16:20:56,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:56,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:20:56,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:20:56,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-14 16:20:56,318 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:56,319 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_11]. (and (= main_a (store (store v_main_a_11 main_x 1000) main_y 0)) (= main_y (+ main_x 1))) [2019-02-14 16:20:56,319 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-02-14 16:20:56,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:56,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:56,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:56,739 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-02-14 16:20:56,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:56,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,047 INFO L303 Elim1Store]: Index analysis took 160 ms [2019-02-14 16:20:57,055 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-02-14 16:20:57,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:57,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,191 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-02-14 16:20:57,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:57,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-14 16:20:57,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,292 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-02-14 16:20:57,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,345 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-02-14 16:20:57,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:57,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:20:57,442 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-02-14 16:20:57,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:57,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-14 16:20:57,738 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-02-14 16:20:57,739 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2019-02-14 16:20:59,938 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:59,938 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_12, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse2 (select v_main_a_12 main_xold))) (and (= (select v_main_a_12 .cse0) 0) (= main_x (mod .cse0 256)) (= (let ((.cse1 (store v_main_a_12 main_x .cse2))) (store .cse1 (mod (+ main_xold 2) 256) (select .cse1 main_yold))) main_a) (= .cse2 1000))) [2019-02-14 16:20:59,939 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4, v_prenex_3]. (let ((.cse6 (select main_a main_x)) (.cse1 (select main_a (+ main_x (- 1))))) (let ((.cse2 (= main_x (mod main_x 256))) (.cse3 (= 1000 .cse1)) (.cse0 (select main_a (mod (+ main_x 1) 256))) (.cse4 (= .cse6 .cse1))) (or (and (= .cse0 .cse1) .cse2 .cse3 .cse4) (let ((.cse5 (select main_a v_prenex_4)) (.cse7 (+ v_prenex_4 1))) (and (= (select main_a (mod (+ v_prenex_4 2) 256)) .cse5) (= .cse6 .cse5) (= .cse5 1000) (= 0 (select main_a .cse7)) (= main_x (mod .cse7 256)))) (and .cse2 .cse3 (= .cse0 (select main_a v_prenex_3)) .cse4) (let ((.cse8 (select main_a main_xold)) (.cse9 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse6 .cse8) (= 0 (select main_a .cse9)) (= .cse8 1000) (= main_x (mod .cse9 256))))))) [2019-02-14 16:21:00,146 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-02-14 16:21:00,290 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-02-14 16:21:02,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-02-14 16:21:02,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} assume a[x] == 0; {50#false} is VALID [2019-02-14 16:21:02,314 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-14 16:21:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:21:02,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:21:02,864 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-14 16:21:02,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-02-14 16:21:02,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {70#(not (= (select main_a main_x) 0))} is VALID [2019-02-14 16:21:02,869 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:21:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:21:02,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:21:02,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-14 16:21:02,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:21:02,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:21:02,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:21:02,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-14 16:21:04,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-02-14 16:21:04,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-14 16:21:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-14 16:21:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:21:04,949 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-02-14 16:21:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:21:09,110 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:21:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:21:09,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:21:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:21:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:21:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-14 16:21:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:21:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-14 16:21:09,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-02-14 16:21:11,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-02-14 16:21:11,203 INFO L225 Difference]: With dead ends: 8 [2019-02-14 16:21:11,203 INFO L226 Difference]: Without dead ends: 6 [2019-02-14 16:21:11,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:21:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-14 16:21:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-14 16:21:11,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:21:11,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-02-14 16:21:11,220 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-14 16:21:11,220 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-14 16:21:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:21:11,221 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-14 16:21:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-14 16:21:11,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:21:11,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:21:11,222 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-14 16:21:11,222 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-14 16:21:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:21:11,223 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-14 16:21:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-14 16:21:11,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:21:11,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:21:11,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:21:11,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:21:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:21:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-14 16:21:11,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-14 16:21:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:21:11,226 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-14 16:21:11,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-14 16:21:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-14 16:21:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:21:11,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:21:11,226 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-14 16:21:11,227 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:21:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:21:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-02-14 16:21:11,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:21:11,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:21:11,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:21:11,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:21:11,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:21:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:21:11,466 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2019-02-14 16:21:11,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} is VALID [2019-02-14 16:21:11,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {113#(= 1000 (select main_a main_x))} is VALID [2019-02-14 16:21:11,471 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2019-02-14 16:21:11,471 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-02-14 16:21:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:21:11,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:21:11,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:21:11,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:21:11,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:21:11,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:21:11,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:21:11,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-14 16:21:11,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-14 16:21:11,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-14 16:21:11,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:21:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:21:11,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:21:11,530 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-02-14 16:21:11,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,539 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-02-14 16:21:11,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:11,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:11,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:11,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-14 16:21:11,560 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:21:11,561 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_14]. (and (= (store (store v_main_a_14 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2019-02-14 16:21:11,561 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-02-14 16:21:11,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,694 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-02-14 16:21:11,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,726 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-02-14 16:21:11,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:11,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,818 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-02-14 16:21:11,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:11,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-14 16:21:11,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,893 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-02-14 16:21:11,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:11,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-14 16:21:11,944 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:12,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:12,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:12,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:12,090 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-02-14 16:21:12,098 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:12,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-14 16:21:12,241 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-02-14 16:21:12,242 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-02-14 16:21:14,415 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:21:14,415 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_15, main_xold, main_yold]. (let ((.cse0 (select v_main_a_15 main_xold)) (.cse2 (+ main_xold 1))) (and (= 1000 .cse0) (= (let ((.cse1 (store v_main_a_15 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a) (= (select v_main_a_15 .cse2) 0) (= main_x (mod .cse2 256)) (= main_y (mod (+ main_xold 2) 256)))) [2019-02-14 16:21:14,415 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_8, v_prenex_7]. (let ((.cse0 (select main_a main_x)) (.cse10 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse3 (select main_a main_y)) (.cse7 (= main_x (mod main_x 256))) (.cse8 (= 1000 .cse10)) (.cse9 (= .cse0 .cse10))) (or (let ((.cse1 (select main_a v_prenex_8)) (.cse2 (+ v_prenex_8 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_8 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= .cse4 1000) (= 0 (select main_a .cse5)) (= main_x (mod .cse5 256)) (= .cse3 (select main_a main_yold)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 .cse7 (= .cse3 (select main_a v_prenex_7)) .cse8 .cse9) (and .cse6 (= .cse3 .cse10) .cse7 .cse8 .cse9)))) [2019-02-14 16:21:14,706 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-02-14 16:21:14,949 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-02-14 16:21:14,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:14,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:14,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:14,976 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-02-14 16:21:14,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:14,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:14,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,017 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-02-14 16:21:15,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,067 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-02-14 16:21:15,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,106 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-02-14 16:21:15,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-14 16:21:15,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,503 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-02-14 16:21:15,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,555 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,576 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-02-14 16:21:15,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:15,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-14 16:21:15,625 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,681 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:15,819 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-02-14 16:21:15,820 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2019-02-14 16:21:18,050 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:21:18,051 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_16, main_xold, main_yold, v_prenex_9, v_subst_1]. (or (let ((.cse1 (select v_main_a_16 (+ main_xold (- 1)))) (.cse2 (mod (+ main_xold 1) 256)) (.cse0 (select v_main_a_16 main_xold))) (and (= .cse0 .cse1) (= main_xold (mod main_xold 256)) (= 1000 .cse1) (= main_x .cse2) (= (let ((.cse3 (store v_main_a_16 main_x .cse0))) (store .cse3 (mod (+ .cse2 1) 256) (select .cse3 main_yold))) main_a))) (let ((.cse8 (+ v_subst_1 1))) (let ((.cse7 (mod .cse8 256))) (let ((.cse5 (select v_prenex_9 .cse7)) (.cse4 (select v_prenex_9 v_subst_1))) (and (= .cse4 .cse5) (= (let ((.cse6 (store v_prenex_9 main_x .cse5))) (store .cse6 (mod (+ (mod (+ v_subst_1 2) 256) 1) 256) (select .cse6 main_yold))) main_a) (= .cse4 1000) (= main_x (mod (+ .cse7 1) 256)) (= 0 (select v_prenex_9 .cse8))))))) [2019-02-14 16:21:18,051 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1, main_yold, v_prenex_11, main_xold, v_prenex_10]. (let ((.cse4 (select main_a main_x))) (or (let ((.cse3 (+ v_subst_1 1))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (select main_a v_subst_1)) (.cse2 (select main_a .cse0))) (and (= main_x (mod (+ .cse0 1) 256)) (= .cse1 .cse2) (= (select main_a .cse3) 0) (= .cse1 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= .cse4 .cse2))))) (let ((.cse8 (+ v_prenex_11 1))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (select main_a v_prenex_11)) (.cse5 (select main_a .cse6))) (and (= .cse5 (select main_a (mod (+ (mod (+ v_prenex_11 2) 256) 1) 256))) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse5) (= .cse7 1000) (= (select main_a .cse8) 0) (= .cse4 .cse5))))) (let ((.cse9 (select main_a main_xold)) (.cse11 (mod (+ main_xold 1) 256)) (.cse10 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse9 .cse10) (= .cse4 .cse9) (= main_x .cse11) (= (select main_a (mod (+ .cse11 1) 256)) (select main_a v_prenex_10)) (= 1000 .cse10))))) [2019-02-14 16:21:18,299 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-02-14 16:21:18,318 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-02-14 16:21:20,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-02-14 16:21:22,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} is UNKNOWN [2019-02-14 16:21:22,406 INFO L273 TraceCheckUtils]: 3: Hoare triple {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} assume a[x] == 0; {110#false} is VALID [2019-02-14 16:21:22,407 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-02-14 16:21:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:21:22,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:21:24,590 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-02-14 16:21:24,591 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2019-02-14 16:21:24,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {135#(not (= (select main_a main_x) 0))} is VALID [2019-02-14 16:21:24,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2019-02-14 16:21:24,599 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2019-02-14 16:21:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-14 16:21:24,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:21:24,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-02-14 16:21:24,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:21:24,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:21:24,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:21:24,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:21:28,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-02-14 16:21:28,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:21:28,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:21:28,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-14 16:21:28,687 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-02-14 16:21:38,225 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-02-14 16:21:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:21:42,440 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-02-14 16:21:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-14 16:21:42,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:21:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:21:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:21:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-02-14 16:21:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:21:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-02-14 16:21:42,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-02-14 16:21:46,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-02-14 16:21:46,547 INFO L225 Difference]: With dead ends: 10 [2019-02-14 16:21:46,547 INFO L226 Difference]: Without dead ends: 8 [2019-02-14 16:21:46,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-14 16:21:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-14 16:21:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-14 16:21:46,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:21:46,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-14 16:21:46,573 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-14 16:21:46,573 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-14 16:21:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:21:46,574 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:21:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:21:46,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:21:46,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:21:46,575 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-14 16:21:46,575 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-14 16:21:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:21:46,577 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:21:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:21:46,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:21:46,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:21:46,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:21:46,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:21:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:21:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-14 16:21:46,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-14 16:21:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:21:46,579 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-14 16:21:46,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:21:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:21:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-14 16:21:46,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:21:46,579 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-14 16:21:46,580 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:21:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:21:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-02-14 16:21:46,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:21:46,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:21:46,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:21:46,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:21:46,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:21:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:21:47,325 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-02-14 16:21:47,404 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2019-02-14 16:21:47,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} is VALID [2019-02-14 16:21:47,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-02-14 16:21:47,415 INFO L273 TraceCheckUtils]: 3: Hoare triple {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} is VALID [2019-02-14 16:21:47,416 INFO L273 TraceCheckUtils]: 4: Hoare triple {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {197#(= (select main_a main_y) 1000)} is VALID [2019-02-14 16:21:47,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#(= (select main_a main_y) 1000)} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2019-02-14 16:21:47,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-02-14 16:21:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:21:47,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:21:47,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:21:47,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:21:47,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:21:47,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:21:47,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:21:47,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-14 16:21:47,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-14 16:21:47,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-14 16:21:47,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:21:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:21:47,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:21:47,686 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-02-14 16:21:47,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-02-14 16:21:47,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:47,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:47,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:47,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-14 16:21:47,761 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:21:47,762 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_19]. (and (= main_y (+ main_x 1)) (= (store (store v_main_a_19 main_x 1000) main_y 0) main_a)) [2019-02-14 16:21:47,762 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-02-14 16:21:47,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,875 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-02-14 16:21:47,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,891 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-02-14 16:21:47,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:47,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:47,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,927 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-02-14 16:21:47,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:47,959 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-02-14 16:21:47,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:47,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:48,022 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-02-14 16:21:48,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-02-14 16:21:50,077 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:21:50,077 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_20, main_yold]. (let ((.cse1 (select v_main_a_20 (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= (select v_main_a_20 main_yold) 0) (= (let ((.cse0 (store v_main_a_20 main_x .cse1))) (store .cse0 main_y (select .cse0 main_yold))) main_a) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 1000))) [2019-02-14 16:21:50,077 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2019-02-14 16:21:50,411 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-02-14 16:21:50,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,429 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-02-14 16:21:50,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,451 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-02-14 16:21:50,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:50,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:50,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,672 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:21:50,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,677 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-02-14 16:21:50,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:50,824 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-02-14 16:21:50,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:50,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:50,973 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-02-14 16:21:50,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-02-14 16:21:53,004 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:21:53,004 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_21, v_subst_2, v_prenex_12, main_xold]. (or (let ((.cse5 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_21 v_subst_2)) (.cse4 (select v_main_a_21 (+ v_subst_2 (- 1)))) (.cse3 (select v_main_a_21 .cse5)) (.cse1 (mod (+ v_subst_2 1) 256))) (and (= 0 .cse0) (= (select v_main_a_21 .cse1) .cse0) (= main_a (let ((.cse2 (store v_main_a_21 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1)))) (= 1000 .cse4) (= .cse4 .cse3) (= main_x (mod (+ .cse5 1) 256)) (= (mod (+ .cse1 1) 256) main_y)))) (let ((.cse8 (select v_prenex_12 main_xold)) (.cse9 (select v_prenex_12 (+ main_xold (- 1)))) (.cse7 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= (let ((.cse6 (store v_prenex_12 main_x .cse8))) (store .cse6 main_y (select .cse6 .cse7))) main_a) (= .cse8 .cse9) (= .cse9 1000) (= main_x .cse7) (= .cse9 (select v_prenex_12 .cse7)) (= main_y (mod (+ .cse7 1) 256))))) [2019-02-14 16:21:53,005 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, main_xold]. (or (let ((.cse3 (mod v_subst_2 256))) (let ((.cse2 (mod (+ v_subst_2 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a .cse3))) (and (= .cse0 1000) (= (select main_a main_y) .cse1) (= 0 (select main_a v_subst_2)) (= (mod (+ .cse2 1) 256) main_y) (= main_x .cse2) (= .cse0 .cse1) (= (select main_a (mod (+ .cse3 1) 256)) .cse1)))) (let ((.cse6 (mod (+ main_xold 1) 256))) (let ((.cse5 (select main_a (+ main_xold (- 1)))) (.cse4 (select main_a main_xold)) (.cse7 (mod (+ .cse6 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse4 .cse5) (= (select main_a main_x) .cse4) (= main_x .cse6) (= main_y .cse7) (= 1000 .cse5) (= .cse4 (select main_a .cse7)))))) [2019-02-14 16:21:53,970 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-02-14 16:21:53,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:53,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:53,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:53,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:53,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:53,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:53,992 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-02-14 16:21:54,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,021 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-02-14 16:21:54,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:54,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:54,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,502 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:21:54,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,546 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-02-14 16:21:54,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:21:54,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-14 16:21:54,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:21:54,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:21:54,943 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-02-14 16:21:54,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2019-02-14 16:21:56,974 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:21:56,975 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_22, v_subst_2, v_prenex_13, v_subst_3]. (or (let ((.cse4 (mod v_subst_2 256)) (.cse2 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (mod (+ .cse2 1) 256)) (.cse3 (select v_main_a_22 (+ v_subst_2 (- 1)))) (.cse5 (select v_main_a_22 .cse4))) (and (= (let ((.cse0 (store v_main_a_22 main_x (select v_main_a_22 .cse2)))) (store .cse0 main_y (select .cse0 .cse1))) main_a) (= (select v_main_a_22 v_subst_2) 0) (= 1000 .cse3) (= (mod (+ .cse1 1) 256) main_y) (= (select v_main_a_22 (mod (+ .cse4 1) 256)) .cse5) (= .cse1 main_x) (= (select v_main_a_22 .cse1) .cse5) (= .cse3 .cse5)))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse7 (select v_prenex_13 (+ v_subst_3 (- 1)))) (.cse9 (select v_prenex_13 .cse11)) (.cse10 (select v_prenex_13 v_subst_3)) (.cse6 (mod (+ .cse11 1) 256))) (and (= .cse6 main_x) (= .cse7 1000) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse8 (store v_prenex_13 main_x .cse9))) (store .cse8 main_y (select .cse8 .cse6))) main_a) (= .cse7 .cse10) (= .cse10 .cse9) (= (select v_prenex_13 .cse6) .cse10) (= main_y (mod (+ .cse6 1) 256)))))) [2019-02-14 16:21:56,975 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_3, v_subst_2]. (let ((.cse3 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_3 1) 256))) (let ((.cse0 (mod (+ .cse4 1) 256)) (.cse2 (select main_a .cse4)) (.cse1 (select main_a v_subst_3))) (and (= .cse0 main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= .cse1 .cse2) (= main_y (mod (+ .cse0 1) 256)) (= .cse3 .cse2) (= (select main_a .cse0) .cse2) (= .cse1 1000)))) (let ((.cse9 (mod v_subst_2 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse5 (select main_a (+ v_subst_2 (- 1)))) (.cse7 (select main_a (mod (+ .cse9 1) 256))) (.cse8 (select main_a .cse9))) (and (= .cse5 1000) (= (mod (+ .cse6 1) 256) main_y) (= .cse7 .cse3) (= .cse6 main_x) (= .cse7 (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= .cse5 .cse8) (= .cse7 .cse8)))))) [2019-02-14 16:21:59,229 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-02-14 16:22:01,305 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-02-14 16:22:01,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,373 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-02-14 16:22:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:01,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-02-14 16:22:01,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:01,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:02,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,776 INFO L303 Elim1Store]: Index analysis took 356 ms [2019-02-14 16:22:02,777 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-02-14 16:22:02,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:22:02,984 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-02-14 16:22:02,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:22:03,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:22:03,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-02-14 16:22:03,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2019-02-14 16:22:05,770 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:22:05,770 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_23, v_subst_2, v_prenex_14, v_subst_3]. (or (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse7 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_23 .cse7)) (.cse2 (select v_main_a_23 (mod (+ .cse7 1) 256))) (.cse3 (mod (+ .cse6 1) 256)) (.cse4 (select v_main_a_23 .cse6)) (.cse1 (select v_main_a_23 (+ v_subst_2 (- 1))))) (and (= .cse0 .cse1) (= .cse2 (select v_main_a_23 .cse3)) (= .cse4 .cse2) (= 0 (select v_main_a_23 v_subst_2)) (= .cse0 .cse2) (= .cse3 main_x) (= main_y (mod (+ .cse3 1) 256)) (= (let ((.cse5 (store v_main_a_23 main_x .cse4))) (store .cse5 main_y (select .cse5 .cse3))) main_a) (= .cse1 1000)))) (let ((.cse14 (mod (+ v_subst_3 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse10 (select v_prenex_14 v_subst_3)) (.cse8 (mod (+ .cse13 1) 256)) (.cse9 (select v_prenex_14 .cse14)) (.cse12 (select v_prenex_14 .cse13))) (and (= main_y (mod (+ .cse8 1) 256)) (= .cse9 .cse10) (= 1000 (select v_prenex_14 (+ v_subst_3 (- 1)))) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse11 (store v_prenex_14 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse8))) main_a) (= main_x .cse8) (= 1000 .cse10) (= (select v_prenex_14 .cse8) .cse9) (= .cse9 .cse12)))))) [2019-02-14 16:22:05,770 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse5 (select main_a main_x))) (or (let ((.cse7 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (let ((.cse6 (mod v_subst_2 256)) (.cse4 (mod (+ .cse7 1) 256))) (let ((.cse2 (mod (+ .cse4 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a (mod (+ .cse6 1) 256))) (.cse3 (select main_a .cse7))) (and (= .cse0 1000) (= .cse1 1000) (= (select main_a .cse2) .cse3) (= .cse4 main_x) (= main_y .cse2) (= 0 (select main_a v_subst_2)) (= .cse5 .cse3) (= .cse0 (select main_a .cse6)) (= .cse1 .cse3))))) (let ((.cse13 (mod (+ v_subst_3 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse9 (select main_a .cse12)) (.cse11 (select main_a .cse13)) (.cse8 (mod (+ .cse12 1) 256)) (.cse10 (select main_a v_subst_3))) (and (= main_y (mod (+ .cse8 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= .cse9 .cse5) (= v_subst_3 (mod v_subst_3 256)) (= .cse9 (select main_a main_y)) (= .cse10 .cse11) (= .cse9 .cse11) (= main_x .cse8) (= .cse10 1000))))))) [2019-02-14 16:22:15,120 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-02-14 16:22:15,185 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-02-14 16:22:17,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-02-14 16:22:19,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2019-02-14 16:22:21,215 INFO L273 TraceCheckUtils]: 3: Hoare triple {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} is UNKNOWN [2019-02-14 16:22:23,224 INFO L273 TraceCheckUtils]: 4: Hoare triple {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} is UNKNOWN [2019-02-14 16:22:23,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} assume a[x] == 0; {192#false} is VALID [2019-02-14 16:22:23,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2019-02-14 16:22:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:22:23,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:22:30,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-02-14 16:22:30,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2019-02-14 16:22:30,395 INFO L273 TraceCheckUtils]: 4: Hoare triple {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-02-14 16:22:30,751 INFO L273 TraceCheckUtils]: 3: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} is VALID [2019-02-14 16:22:31,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-02-14 16:22:31,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-02-14 16:22:31,699 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-02-14 16:22:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-14 16:22:31,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:22:31,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-02-14 16:22:31,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:22:31,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-14 16:22:31,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:22:31,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-02-14 16:22:38,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 11 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-02-14 16:22:38,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-14 16:22:38,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-14 16:22:38,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=136, Unknown=2, NotChecked=0, Total=210 [2019-02-14 16:22:38,923 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-02-14 16:23:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:23:20,541 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-02-14 16:23:20,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-14 16:23:20,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-14 16:23:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:23:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-14 16:23:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-14 16:23:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-14 16:23:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-14 16:23:20,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2019-02-14 16:23:28,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 12 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2019-02-14 16:23:28,621 INFO L225 Difference]: With dead ends: 14 [2019-02-14 16:23:28,621 INFO L226 Difference]: Without dead ends: 11 [2019-02-14 16:23:28,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=72, Invalid=136, Unknown=2, NotChecked=0, Total=210 [2019-02-14 16:23:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-14 16:23:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-14 16:23:28,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:23:28,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-02-14 16:23:28,758 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-14 16:23:28,758 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-14 16:23:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:23:28,759 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-14 16:23:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-14 16:23:28,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:23:28,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:23:28,760 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-14 16:23:28,760 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-14 16:23:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:23:28,761 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-14 16:23:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-14 16:23:28,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:23:28,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:23:28,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:23:28,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:23:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-14 16:23:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-14 16:23:28,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-02-14 16:23:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:23:28,763 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-14 16:23:28,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-14 16:23:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-14 16:23:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-14 16:23:28,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:23:28,764 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-14 16:23:28,764 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:23:28,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:23:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 4 times [2019-02-14 16:23:28,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:23:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:23:28,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:23:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:23:28,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:23:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:23:29,269 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2019-02-14 16:23:29,419 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {309#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2019-02-14 16:23:29,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {310#(and (= 1000 (select main_a main_x)) (<= main_y 255) (or (<= (+ main_x 1) main_y) (and (<= main_x 255) (<= (+ main_y 255) main_x))) (<= main_y (+ main_x 1)) (< 0 (+ main_y 1)))} is VALID [2019-02-14 16:23:29,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#(and (= 1000 (select main_a main_x)) (<= main_y 255) (or (<= (+ main_x 1) main_y) (and (<= main_x 255) (<= (+ main_y 255) main_x))) (<= main_y (+ main_x 1)) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {311#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-02-14 16:23:29,429 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-02-14 16:23:29,431 INFO L273 TraceCheckUtils]: 4: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-02-14 16:23:29,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-02-14 16:23:29,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-02-14 16:23:29,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {313#(= (select main_a main_y) 1000)} is VALID [2019-02-14 16:23:29,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {313#(= (select main_a main_y) 1000)} assume a[x] == 0; {313#(= (select main_a main_y) 1000)} is VALID [2019-02-14 16:23:29,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {313#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {308#false} is VALID [2019-02-14 16:23:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-14 16:23:29,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:23:29,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:23:29,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:23:29,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:23:29,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:23:29,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:23:29,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:23:29,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:23:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:23:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:23:30,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:23:30,982 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-02-14 16:23:30,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:30,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:30,988 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-02-14 16:23:30,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:30,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:31,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:31,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-14 16:23:31,007 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:23:31,007 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_28]. (and (= (store (store v_main_a_28 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2019-02-14 16:23:31,007 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-02-14 16:23:31,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,097 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-02-14 16:23:31,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,117 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-02-14 16:23:31,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:31,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,247 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-02-14 16:23:31,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:31,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-14 16:23:31,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 54 [2019-02-14 16:23:31,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,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 48 treesize of output 70 [2019-02-14 16:23:31,363 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:31,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:31,459 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-02-14 16:23:31,463 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:31,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-14 16:23:31,572 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-02-14 16:23:31,572 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-02-14 16:23:33,794 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:23:33,794 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_29, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse1 (select v_main_a_29 main_xold))) (and (= main_x (mod .cse0 256)) (= .cse1 1000) (= main_y (mod (+ main_xold 2) 256)) (= 0 (select v_main_a_29 .cse0)) (= (let ((.cse2 (store v_main_a_29 main_x .cse1))) (store .cse2 main_y (select .cse2 main_yold))) main_a))) [2019-02-14 16:23:33,795 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, v_prenex_18, v_prenex_19, main_yold]. (let ((.cse0 (select main_a main_x)) (.cse7 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse8 (= main_x (mod main_x 256))) (.cse3 (select main_a main_y)) (.cse9 (= 1000 .cse7)) (.cse10 (= .cse0 .cse7))) (or (let ((.cse1 (select main_a v_prenex_19)) (.cse2 (+ v_prenex_19 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_19 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= 0 (select main_a .cse5)) (= .cse4 1000) (= main_x (mod .cse5 256)) (= .cse3 (select main_a v_prenex_18)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 (= .cse3 .cse7) .cse8 .cse9 .cse10) (and .cse6 .cse8 (= .cse3 (select main_a main_yold)) .cse9 .cse10)))) [2019-02-14 16:23:34,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,131 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 57 treesize of output 75 [2019-02-14 16:23:34,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,163 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 32 treesize of output 76 [2019-02-14 16:23:34,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,252 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 56 treesize of output 74 [2019-02-14 16:23:34,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,273 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-02-14 16:23:34,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,558 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 67 treesize of output 125 [2019-02-14 16:23:34,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 135 [2019-02-14 16:23:34,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,728 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,753 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 70 treesize of output 128 [2019-02-14 16:23:34,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:34,798 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 61 treesize of output 132 [2019-02-14 16:23:34,801 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,853 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:34,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-14 16:23:34,958 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:131, output treesize:135 [2019-02-14 16:23:37,117 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:23:37,117 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_30, v_subst_4, main_yold, v_prenex_20, main_xold]. (or (let ((.cse1 (+ v_subst_4 1))) (let ((.cse4 (mod .cse1 256))) (let ((.cse0 (select v_main_a_30 v_subst_4)) (.cse2 (select v_main_a_30 .cse4))) (and (= .cse0 1000) (= (select v_main_a_30 .cse1) 0) (= .cse0 .cse2) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= (let ((.cse3 (store v_main_a_30 main_x .cse2))) (store .cse3 main_y (select .cse3 main_yold))) main_a) (= main_x (mod (+ .cse4 1) 256)))))) (let ((.cse6 (select v_prenex_20 main_xold)) (.cse7 (select v_prenex_20 (+ main_xold (- 1)))) (.cse8 (mod (+ main_xold 1) 256))) (and (= (let ((.cse5 (store v_prenex_20 main_x .cse6))) (store .cse5 main_y (select .cse5 main_yold))) main_a) (= main_xold (mod main_xold 256)) (= 1000 .cse7) (= main_x .cse8) (= .cse6 .cse7) (= main_y (mod (+ .cse8 1) 256))))) [2019-02-14 16:23:37,117 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_subst_4, v_prenex_21]. (let ((.cse2 (select main_a main_x))) (or (let ((.cse3 (mod (+ main_xold 1) 256))) (let ((.cse0 (select main_a main_xold)) (.cse4 (mod (+ .cse3 1) 256)) (.cse1 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse0 .cse1) (= .cse2 .cse0) (= main_x .cse3) (= (select main_a .cse4) (select main_a main_yold)) (= main_y .cse4) (= 1000 .cse1)))) (let ((.cse9 (+ v_subst_4 1))) (let ((.cse7 (mod .cse9 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse8 (select main_a .cse7)) (.cse5 (select main_a v_subst_4))) (and (= 1000 .cse5) (= (select main_a .cse6) (select main_a v_prenex_21)) (= main_y .cse6) (= main_x (mod (+ .cse7 1) 256)) (= .cse8 .cse2) (= .cse8 .cse5) (= 0 (select main_a .cse9)))))))) [2019-02-14 16:23:37,807 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-02-14 16:23:38,430 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-14 16:23:38,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 181 [2019-02-14 16:23:38,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 198 [2019-02-14 16:23:38,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:38,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:38,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 95 treesize of output 178 [2019-02-14 16:23:38,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:38,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 201 [2019-02-14 16:23:38,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:39,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:39,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 156 [2019-02-14 16:23:39,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:39,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:40,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,815 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:23:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:40,984 INFO L303 Elim1Store]: Index analysis took 262 ms [2019-02-14 16:23:41,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 113 treesize of output 301 [2019-02-14 16:23:41,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,297 INFO L303 Elim1Store]: Index analysis took 224 ms [2019-02-14 16:23:41,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 292 treesize of output 336 [2019-02-14 16:23:41,316 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:41,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:41,836 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-02-14 16:23:41,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 302 [2019-02-14 16:23:41,860 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:42,000 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:42,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,414 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:23:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,580 INFO L303 Elim1Store]: Index analysis took 446 ms [2019-02-14 16:23:42,609 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 296 [2019-02-14 16:23:42,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:42,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 317 [2019-02-14 16:23:42,671 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:43,051 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:43,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-14 16:23:43,274 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:223, output treesize:189 [2019-02-14 16:23:45,427 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:23:45,427 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_31, v_subst_4, main_yold, v_prenex_21, v_prenex_24, v_subst_5, v_prenex_22]. (or (let ((.cse2 (+ v_subst_4 1))) (let ((.cse7 (mod .cse2 256))) (let ((.cse6 (mod (+ .cse7 1) 256))) (let ((.cse0 (select v_main_a_31 v_subst_4)) (.cse5 (select v_main_a_31 .cse6)) (.cse1 (select v_main_a_31 .cse7)) (.cse3 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (and (= .cse0 .cse1) (= 0 (select v_main_a_31 .cse2)) (= (mod (+ .cse3 1) 256) main_y) (= .cse0 1000) (= (let ((.cse4 (store v_main_a_31 main_x .cse5))) (store .cse4 main_y (select .cse4 main_yold))) main_a) (= .cse5 .cse1) (= (select v_main_a_31 .cse3) (select v_main_a_31 v_prenex_21)) (= main_x (mod (+ .cse6 1) 256))))))) (let ((.cse13 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse13 1) 256)) (.cse10 (select v_prenex_24 .cse13)) (.cse11 (select v_prenex_24 v_subst_5)) (.cse9 (select v_prenex_24 (+ v_subst_5 (- 1))))) (and (= (select v_prenex_24 v_prenex_22) (select v_prenex_24 .cse8)) (= main_y (mod (+ .cse8 1) 256)) (= 1000 .cse9) (= .cse10 .cse11) (= main_x .cse8) (= v_subst_5 (mod v_subst_5 256)) (= main_a (let ((.cse12 (store v_prenex_24 main_x .cse10))) (store .cse12 main_y (select .cse12 main_yold)))) (= .cse11 .cse9))))) [2019-02-14 16:23:45,428 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_29, v_subst_5, main_yold, v_subst_4]. (let ((.cse4 (select main_a main_y))) (or (let ((.cse5 (mod (+ v_subst_5 1) 256))) (let ((.cse0 (select main_a .cse5)) (.cse3 (select main_a v_subst_5)) (.cse2 (select main_a (+ v_subst_5 (- 1)))) (.cse1 (mod (+ .cse5 1) 256))) (and (= .cse0 (select main_a .cse1)) (= .cse2 1000) (= .cse3 .cse0) (= .cse3 .cse2) (= main_y (mod (+ .cse1 1) 256)) (= .cse4 (select main_a v_prenex_29)) (= main_x .cse1) (= v_subst_5 (mod v_subst_5 256))))) (let ((.cse11 (+ v_subst_4 1))) (let ((.cse12 (mod .cse11 256))) (let ((.cse10 (mod (+ .cse12 1) 256))) (let ((.cse9 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse7 (select main_a .cse10)) (.cse6 (select main_a .cse12)) (.cse8 (select main_a v_subst_4))) (and (= .cse6 .cse7) (= 1000 .cse8) (= (mod (+ .cse9 1) 256) main_y) (= .cse4 (select main_a main_yold)) (= (select main_a .cse9) .cse7) (= .cse6 .cse8) (= main_x (mod (+ .cse10 1) 256)) (= 0 (select main_a .cse11))))))))) [2019-02-14 16:23:50,964 WARN L181 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-02-14 16:23:51,560 WARN L181 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-02-14 16:23:51,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:51,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,230 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:23:52,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,329 INFO L303 Elim1Store]: Index analysis took 756 ms [2019-02-14 16:23:52,330 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 144 treesize of output 365 [2019-02-14 16:23:52,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,404 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 111 treesize of output 342 [2019-02-14 16:23:52,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:52,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:52,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,908 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:23:52,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:52,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,079 INFO L303 Elim1Store]: Index analysis took 285 ms [2019-02-14 16:23:53,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 358 [2019-02-14 16:23:53,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:53,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 341 [2019-02-14 16:23:53,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:53,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:58,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 216 [2019-02-14 16:23:58,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:58,994 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 78 treesize of output 207 [2019-02-14 16:23:58,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:59,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:23:59,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 209 [2019-02-14 16:23:59,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:23:59,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 206 [2019-02-14 16:23:59,283 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:23:59,415 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:24:00,260 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-02-14 16:24:00,261 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:267, output treesize:367 [2019-02-14 16:24:02,400 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:24:02,401 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_31, v_subst_4, main_yold, v_main_a_32, v_subst_5]. (or (let ((.cse3 (+ v_subst_4 1))) (let ((.cse8 (mod .cse3 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse0 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse1 (select v_prenex_31 v_subst_4)) (.cse6 (mod (+ .cse7 1) 256)) (.cse4 (select v_prenex_31 .cse8)) (.cse2 (select v_prenex_31 .cse7))) (and (= main_y (mod (+ (mod (+ .cse0 1) 256) 1) 256)) (= .cse1 1000) (= (select v_prenex_31 .cse0) .cse2) (= (select v_prenex_31 .cse3) 0) (= .cse1 .cse4) (= (let ((.cse5 (store v_prenex_31 main_x (select v_prenex_31 .cse6)))) (store .cse5 main_y (select .cse5 main_yold))) main_a) (= (mod (+ .cse6 1) 256) main_x) (= .cse4 .cse2)))))) (let ((.cse16 (mod (+ v_subst_5 1) 256))) (let ((.cse15 (mod (+ .cse16 1) 256))) (let ((.cse10 (select v_main_a_32 .cse16)) (.cse9 (select v_main_a_32 v_subst_5)) (.cse13 (select v_main_a_32 (+ v_subst_5 (- 1)))) (.cse11 (select v_main_a_32 .cse15)) (.cse12 (mod (+ .cse15 1) 256))) (and (= .cse9 .cse10) (= .cse11 .cse10) (= main_x .cse12) (= .cse9 .cse13) (= 1000 .cse13) (= (let ((.cse14 (store v_main_a_32 main_x .cse11))) (store .cse14 main_y (select .cse14 main_yold))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse12 1) 256))))))) [2019-02-14 16:24:02,401 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_prenex_32, v_prenex_33, v_subst_4, main_yold]. (let ((.cse6 (select main_a main_y)) (.cse5 (select main_a main_x))) (or (let ((.cse8 (mod (+ v_prenex_33 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse0 (select main_a .cse8)) (.cse3 (select main_a v_prenex_33)) (.cse2 (select main_a (+ v_prenex_33 (- 1)))) (.cse1 (select main_a .cse7)) (.cse4 (mod (+ .cse7 1) 256))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse3 .cse0) (= .cse3 .cse2) (= main_x .cse4) (= .cse1 .cse5) (= .cse1 .cse6) (= v_prenex_33 (mod v_prenex_33 256)) (= main_y (mod (+ .cse4 1) 256)))))) (let ((.cse15 (mod (+ v_subst_5 1) 256))) (let ((.cse14 (mod (+ .cse15 1) 256))) (let ((.cse9 (select main_a .cse15)) (.cse12 (select main_a v_subst_5)) (.cse11 (select main_a (+ v_subst_5 (- 1)))) (.cse10 (select main_a .cse14)) (.cse13 (mod (+ .cse14 1) 256))) (and (= .cse9 .cse10) (= .cse11 1000) (= .cse12 .cse9) (= .cse12 .cse11) (= main_x .cse13) (= .cse10 .cse5) (= .cse6 (select main_a v_prenex_32)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse13 1) 256)))))) (let ((.cse22 (+ v_subst_4 1))) (let ((.cse23 (mod .cse22 256))) (let ((.cse21 (mod (+ .cse23 1) 256)) (.cse24 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse16 (mod (+ (mod (+ .cse24 1) 256) 1) 256)) (.cse18 (select main_a .cse21)) (.cse20 (select main_a .cse24)) (.cse17 (select main_a .cse23)) (.cse19 (select main_a v_subst_4))) (and (= main_y .cse16) (= .cse17 .cse18) (= 1000 .cse19) (= (select main_a .cse16) (select main_a main_yold)) (= .cse20 .cse18) (= .cse5 .cse20) (= (mod (+ (mod (+ .cse21 1) 256) 1) 256) main_x) (= .cse17 .cse19) (= 0 (select main_a .cse22))))))))) [2019-02-14 16:24:15,782 WARN L181 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-02-14 16:24:17,332 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 100 [2019-02-14 16:24:17,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,485 INFO L303 Elim1Store]: Index analysis took 138 ms [2019-02-14 16:24:17,504 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 5 case distinctions, treesize of input 150 treesize of output 342 [2019-02-14 16:24:17,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,780 INFO L303 Elim1Store]: Index analysis took 217 ms [2019-02-14 16:24:17,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 347 [2019-02-14 16:24:17,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:24:17,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:24:17,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:17,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 353 [2019-02-14 16:24:18,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:18,079 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 113 treesize of output 352 [2019-02-14 16:24:18,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:24:18,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:24:25,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,798 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:24:25,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:25,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,596 INFO L303 Elim1Store]: Index analysis took 865 ms [2019-02-14 16:24:26,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 199 treesize of output 683 [2019-02-14 16:24:26,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:26,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:27,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:27,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:27,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:27,567 INFO L303 Elim1Store]: Index analysis took 709 ms [2019-02-14 16:24:27,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 655 treesize of output 759 [2019-02-14 16:24:27,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:24:29,997 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:24:30,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,218 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:24:30,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:30,835 INFO L303 Elim1Store]: Index analysis took 819 ms [2019-02-14 16:24:31,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 214 treesize of output 678 [2019-02-14 16:24:31,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:31,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:31,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:31,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:31,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:31,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:31,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:31,329 INFO L303 Elim1Store]: Index analysis took 174 ms [2019-02-14 16:24:31,330 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 669 treesize of output 770 [2019-02-14 16:24:31,336 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:24:32,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:32,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:32,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:24:33,804 INFO L303 Elim1Store]: Index analysis took 927 ms [2019-02-14 16:24:33,805 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 205 treesize of output 740 [2019-02-14 16:24:33,809 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-14 16:24:35,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:24:36,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-14 16:24:36,270 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:380, output treesize:353 [2019-02-14 16:24:38,395 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:24:38,396 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_33, v_subst_4, main_yold, v_prenex_34, v_prenex_36, v_subst_5]. (or (let ((.cse2 (+ v_subst_4 1))) (let ((.cse9 (mod .cse2 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse6 (mod (+ (mod (+ .cse10 1) 256) 1) 256))) (let ((.cse0 (select v_main_a_33 .cse6)) (.cse1 (select v_main_a_33 .cse11)) (.cse4 (select v_main_a_33 v_subst_4)) (.cse5 (mod (+ (mod (+ .cse11 1) 256) 1) 256)) (.cse7 (select v_main_a_33 .cse10)) (.cse8 (select v_main_a_33 .cse9))) (and (= .cse0 .cse1) (= (select v_main_a_33 .cse2) 0) (= (let ((.cse3 (store v_main_a_33 main_x .cse0))) (store .cse3 main_y (select .cse3 main_yold))) main_a) (= .cse4 1000) (= (select v_main_a_33 .cse5) (select v_main_a_33 v_prenex_34)) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse1) (= .cse4 .cse8) (= main_y (mod (+ .cse5 1) 256)) (= .cse7 .cse8))))))) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse13 (select v_prenex_36 .cse21)) (.cse15 (select v_prenex_36 v_subst_5)) (.cse14 (mod (+ .cse21 1) 256)) (.cse17 (select v_prenex_36 .cse20)) (.cse18 (select v_prenex_36 .cse19)) (.cse16 (select v_prenex_36 (+ v_subst_5 (- 1))))) (and (= main_a (let ((.cse12 (store v_prenex_36 main_x .cse13))) (store .cse12 main_y (select .cse12 main_yold)))) (= main_x .cse14) (= .cse15 .cse16) (= .cse17 .cse13) (= .cse15 .cse18) (= main_y (mod (+ .cse14 1) 256)) (= .cse17 .cse18) (= v_subst_5 (mod v_subst_5 256)) (= .cse16 1000))))))) [2019-02-14 16:24:38,396 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, main_yold, v_subst_5, v_prenex_39]. (or (let ((.cse7 (+ v_subst_4 1))) (let ((.cse9 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse8 (mod .cse7 256))) (let ((.cse10 (mod (+ .cse8 1) 256)) (.cse5 (mod (+ (mod (+ .cse9 1) 256) 1) 256))) (let ((.cse3 (mod (+ .cse5 1) 256)) (.cse1 (select main_a .cse10)) (.cse4 (select main_a (mod (+ (mod (+ .cse10 1) 256) 1) 256))) (.cse6 (select main_a .cse9)) (.cse0 (select main_a .cse8)) (.cse2 (select main_a v_subst_4))) (and (= .cse0 .cse1) (= 1000 .cse2) (= (select main_a .cse3) (select main_a main_yold)) (= main_y .cse3) (= .cse4 (select main_a .cse5)) (= .cse6 .cse1) (= .cse4 .cse6) (= .cse0 .cse2) (= main_x .cse5) (= 0 (select main_a .cse7))))))) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse11 (select main_a .cse19)) (.cse14 (select main_a v_subst_5)) (.cse13 (select main_a (+ v_subst_5 (- 1)))) (.cse16 (select main_a .cse17)) (.cse12 (select main_a .cse18)) (.cse15 (mod (+ .cse17 1) 256))) (and (= .cse11 .cse12) (= .cse13 1000) (= .cse14 .cse11) (= main_x .cse15) (= .cse14 .cse13) (= .cse16 (select main_a main_x)) (= .cse16 .cse12) (= main_y (mod (+ .cse15 1) 256)) (= (select main_a main_y) (select main_a v_prenex_39)) (= v_subst_5 (mod v_subst_5 256)))))))) [2019-02-14 16:25:08,217 WARN L181 SmtUtils]: Spent 8.70 s on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-02-14 16:25:11,281 WARN L181 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 106 [2019-02-14 16:25:11,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:11,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:12,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:12,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:12,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:12,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,632 INFO L303 Elim1Store]: Index analysis took 2333 ms [2019-02-14 16:25:13,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 3 new quantified variables, introduced 17 case distinctions, treesize of input 246 treesize of output 941 [2019-02-14 16:25:13,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:13,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:14,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:14,040 INFO L303 Elim1Store]: Index analysis took 200 ms [2019-02-14 16:25:14,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 909 treesize of output 1017 [2019-02-14 16:25:14,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:25:17,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:25:17,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:17,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:17,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:17,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:17,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:17,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:17,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:18,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:19,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:19,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:19,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:19,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:19,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:20,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:20,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:20,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:20,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:20,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:21,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:21,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,580 INFO L303 Elim1Store]: Index analysis took 6144 ms [2019-02-14 16:25:23,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 261 treesize of output 932 [2019-02-14 16:25:23,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:23,803 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-02-14 16:25:23,804 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 923 treesize of output 1028 [2019-02-14 16:25:23,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:25:29,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:29,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:30,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:31,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:31,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:31,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:31,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:31,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:25:31,419 INFO L303 Elim1Store]: Index analysis took 2361 ms [2019-02-14 16:25:31,420 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 256 treesize of output 1017 [2019-02-14 16:25:31,426 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:25:33,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:26:02,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 550 [2019-02-14 16:26:02,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:02,856 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 156 treesize of output 561 [2019-02-14 16:26:02,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:26:03,300 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:26:03,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,439 INFO L303 Elim1Store]: Index analysis took 128 ms [2019-02-14 16:26:03,447 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 6 case distinctions, treesize of input 197 treesize of output 535 [2019-02-14 16:26:03,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:26:03,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 552 [2019-02-14 16:26:03,567 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-14 16:26:03,829 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:26:07,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-02-14 16:26:07,351 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:478, output treesize:641 [2019-02-14 16:26:09,472 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:26:09,472 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_34, v_subst_4, main_yold, v_prenex_40, v_prenex_41, v_subst_5]. (or (let ((.cse8 (+ v_subst_4 1))) (let ((.cse10 (mod .cse8 256)) (.cse12 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse9 (mod (+ (mod (+ .cse12 1) 256) 1) 256)) (.cse11 (mod (+ .cse10 1) 256))) (let ((.cse0 (select v_main_a_34 (mod (+ (mod (+ .cse11 1) 256) 1) 256))) (.cse2 (select v_main_a_34 v_subst_4)) (.cse1 (select v_main_a_34 .cse12)) (.cse3 (select v_main_a_34 .cse9)) (.cse6 (select v_main_a_34 .cse11)) (.cse4 (select v_main_a_34 .cse10)) (.cse5 (mod (+ .cse9 1) 256))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse0 .cse3) (= .cse2 .cse4) (= (select v_main_a_34 .cse5) (select v_main_a_34 v_prenex_40)) (= .cse6 .cse1) (= (let ((.cse7 (store v_main_a_34 main_x .cse3))) (store .cse7 main_y (select .cse7 main_yold))) main_a) (= 0 (select v_main_a_34 .cse8)) (= .cse6 .cse4) (= main_x .cse5) (= main_y (mod (+ .cse5 1) 256))))))) (let ((.cse24 (mod (+ v_subst_5 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse22 1) 256))) (let ((.cse16 (mod (+ .cse21 1) 256)) (.cse14 (select v_prenex_41 v_subst_5)) (.cse13 (select v_prenex_41 (+ v_subst_5 (- 1)))) (.cse15 (select v_prenex_41 .cse24)) (.cse17 (select v_prenex_41 .cse23)) (.cse19 (select v_prenex_41 .cse22)) (.cse18 (select v_prenex_41 .cse21))) (and (= .cse13 1000) (= .cse14 .cse15) (= main_x .cse16) (= main_y (mod (+ .cse16 1) 256)) (= .cse14 .cse13) (= .cse15 .cse17) (= .cse18 .cse19) (= v_subst_5 (mod v_subst_5 256)) (= .cse17 .cse19) (= (let ((.cse20 (store v_prenex_41 main_x .cse18))) (store .cse20 main_y (select .cse20 main_yold))) main_a)))))))) [2019-02-14 16:26:09,473 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_45, main_yold, v_subst_5, v_prenex_46, v_subst_4]. (let ((.cse3 (select main_a main_x)) (.cse8 (select main_a main_y))) (or (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse9 (mod (+ .cse12 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse0 (select main_a .cse12)) (.cse6 (select main_a v_subst_5)) (.cse2 (select main_a (+ v_subst_5 (- 1)))) (.cse7 (mod (+ .cse11 1) 256)) (.cse4 (select main_a .cse11)) (.cse5 (select main_a .cse10)) (.cse1 (select main_a .cse9))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse3 .cse4) (= .cse5 .cse4) (= .cse6 .cse0) (= .cse6 .cse2) (= main_x .cse7) (= main_y (mod (+ .cse7 1) 256)) (= .cse8 .cse4) (= .cse5 .cse1) (= v_subst_5 (mod v_subst_5 256)))))))) (let ((.cse23 (mod (+ v_prenex_45 1) 256))) (let ((.cse20 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse22 (mod (+ .cse21 1) 256))) (let ((.cse16 (select main_a .cse22)) (.cse14 (select main_a .cse23)) (.cse18 (select main_a v_prenex_45)) (.cse13 (select main_a (+ v_prenex_45 (- 1)))) (.cse19 (mod (+ .cse22 1) 256)) (.cse17 (select main_a .cse21)) (.cse15 (select main_a .cse20))) (and (= .cse13 1000) (= .cse14 .cse15) (= .cse3 .cse16) (= .cse17 .cse16) (= .cse18 .cse14) (= .cse18 .cse13) (= main_x .cse19) (= main_y (mod (+ .cse19 1) 256)) (= .cse17 .cse15) (= .cse8 (select main_a main_yold)) (= v_prenex_45 (mod v_prenex_45 256)))))))) (let ((.cse31 (+ v_subst_4 1))) (let ((.cse33 (mod .cse31 256)) (.cse34 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse32 (mod (+ (mod (+ .cse34 1) 256) 1) 256)) (.cse35 (mod (+ .cse33 1) 256))) (let ((.cse25 (select main_a .cse35)) (.cse27 (select main_a (mod (+ (mod (+ .cse35 1) 256) 1) 256))) (.cse29 (select main_a .cse34)) (.cse28 (select main_a .cse32)) (.cse24 (select main_a .cse33)) (.cse26 (select main_a v_subst_4)) (.cse30 (mod (+ .cse32 1) 256))) (and (= .cse24 .cse25) (= 1000 .cse26) (= .cse27 .cse28) (= .cse8 (select main_a v_prenex_46)) (= .cse29 .cse25) (= .cse27 .cse29) (= (select main_a .cse30) .cse28) (= main_x .cse30) (= .cse24 .cse26) (= main_y (mod (+ .cse30 1) 256)) (= 0 (select main_a .cse31))))))))) [2019-02-14 16:26:53,111 WARN L181 SmtUtils]: Spent 13.36 s on a formula simplification. DAG size of input: 130 DAG size of output: 85 [2019-02-14 16:27:24,114 WARN L181 SmtUtils]: Spent 30.91 s on a formula simplification that was a NOOP. DAG size: 107 [2019-02-14 16:27:24,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:24,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:24,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:24,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:24,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:25,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:26,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:26,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:26,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:26,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:27,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:27,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:27,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:27,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:27,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:28,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:28,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:28,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:28,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:28,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:28,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:29,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:29,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:29,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:29,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:29,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:29,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,545 INFO L303 Elim1Store]: Index analysis took 6405 ms [2019-02-14 16:27:30,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 271 treesize of output 1023 [2019-02-14 16:27:30,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:30,904 INFO L303 Elim1Store]: Index analysis took 271 ms [2019-02-14 16:27:30,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 48 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 256 treesize of output 1360 [2019-02-14 16:27:30,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:27:35,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:27:36,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:36,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:37,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:37,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:37,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:38,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:38,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:38,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:38,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:39,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:39,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:39,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:39,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:40,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:40,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:40,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:41,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:43,480 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (+ v_subst_4 1) (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) [2019-02-14 16:27:43,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:43,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:43,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:43,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:43,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:44,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:44,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:44,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:44,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:44,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:44,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:45,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:45,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:46,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:46,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,445 INFO L303 Elim1Store]: Index analysis took 11720 ms [2019-02-14 16:27:47,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 1042 [2019-02-14 16:27:47,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:27:47,902 INFO L303 Elim1Store]: Index analysis took 393 ms [2019-02-14 16:27:47,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 47 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 1373 [2019-02-14 16:27:47,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:27:52,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:28:53,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:53,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:53,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:53,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,457 INFO L303 Elim1Store]: Index analysis took 580 ms [2019-02-14 16:28:54,464 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 7 case distinctions, treesize of input 249 treesize of output 797 [2019-02-14 16:28:54,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:54,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 215 treesize of output 1085 [2019-02-14 16:28:54,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:28:55,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:28:55,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,320 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-02-14 16:28:55,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 816 [2019-02-14 16:28:55,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:28:55,476 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-02-14 16:28:55,477 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 235 treesize of output 1098 [2019-02-14 16:28:55,484 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:28:56,711 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:29:04,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-14 16:29:04,019 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:563, output treesize:515 [2019-02-14 16:29:06,132 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:29:06,133 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_prenex_45, main_yold, v_prenex_47, v_subst_4]. (or (let ((.cse13 (mod (+ v_prenex_45 1) 256))) (let ((.cse11 (mod (+ .cse13 1) 256))) (let ((.cse10 (mod (+ .cse11 1) 256))) (let ((.cse12 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse12 1) 256))) (let ((.cse1 (select v_main_a_35 .cse13)) (.cse3 (select v_main_a_35 .cse12)) (.cse7 (select v_main_a_35 .cse9)) (.cse2 (select v_main_a_35 .cse11)) (.cse4 (select v_main_a_35 .cse10)) (.cse6 (mod (+ .cse9 1) 256)) (.cse0 (select v_main_a_35 v_prenex_45)) (.cse8 (select v_main_a_35 (+ v_prenex_45 (- 1))))) (and (= .cse0 .cse1) (= v_prenex_45 (mod v_prenex_45 256)) (= .cse2 .cse1) (= .cse3 .cse4) (= (let ((.cse5 (store v_main_a_35 main_x .cse7))) (store .cse5 (mod (+ .cse6 1) 256) (select .cse5 main_yold))) main_a) (= 1000 .cse8) (= .cse3 .cse7) (= .cse2 .cse4) (= main_x .cse6) (= .cse0 .cse8)))))))) (let ((.cse18 (+ v_subst_4 1)) (.cse25 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse27 (mod (+ (mod (+ .cse25 1) 256) 1) 256)) (.cse26 (mod .cse18 256))) (let ((.cse24 (mod (+ .cse26 1) 256)) (.cse28 (mod (+ .cse27 1) 256))) (let ((.cse16 (mod (+ .cse28 1) 256)) (.cse14 (select v_prenex_47 .cse28)) (.cse17 (select v_prenex_47 v_subst_4)) (.cse15 (select v_prenex_47 .cse27)) (.cse21 (select v_prenex_47 (mod (+ (mod (+ .cse24 1) 256) 1) 256))) (.cse20 (select v_prenex_47 .cse26)) (.cse22 (select v_prenex_47 .cse25)) (.cse23 (select v_prenex_47 .cse24))) (and (= .cse14 .cse15) (= main_x .cse16) (= .cse17 1000) (= (select v_prenex_47 .cse18) 0) (= (let ((.cse19 (store v_prenex_47 main_x .cse14))) (store .cse19 (mod (+ .cse16 1) 256) (select .cse19 main_yold))) main_a) (= .cse17 .cse20) (= .cse21 .cse15) (= .cse22 .cse21) (= .cse23 .cse20) (= .cse22 .cse23))))))) [2019-02-14 16:29:06,133 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_49, v_prenex_45, v_subst_4, main_yold]. (let ((.cse8 (select main_a main_x))) (or (let ((.cse12 (mod (+ v_prenex_45 1) 256))) (let ((.cse13 (mod (+ .cse12 1) 256))) (let ((.cse9 (mod (+ .cse13 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse5 (select main_a v_prenex_45)) (.cse1 (select main_a .cse11)) (.cse2 (select main_a .cse13)) (.cse6 (select main_a .cse12)) (.cse4 (mod (+ .cse11 1) 256)) (.cse7 (select main_a (+ v_prenex_45 (- 1)))) (.cse0 (select main_a .cse10)) (.cse3 (select main_a .cse9))) (and (= .cse0 .cse1) (= v_prenex_45 (mod v_prenex_45 256)) (= .cse2 .cse3) (= (select main_a v_prenex_49) (select main_a (mod (+ .cse4 1) 256))) (= .cse5 .cse6) (= .cse5 .cse7) (= .cse8 .cse1) (= .cse2 .cse6) (= main_x .cse4) (= .cse7 1000) (= .cse0 .cse3)))))))) (let ((.cse22 (+ v_subst_4 1)) (.cse26 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse25 (mod (+ (mod (+ .cse26 1) 256) 1) 256)) (.cse23 (mod .cse22 256))) (let ((.cse27 (mod (+ .cse23 1) 256)) (.cse24 (mod (+ .cse25 1) 256))) (let ((.cse17 (mod (+ .cse24 1) 256)) (.cse15 (select main_a .cse27)) (.cse18 (select main_a (mod (+ (mod (+ .cse27 1) 256) 1) 256))) (.cse20 (select main_a .cse26)) (.cse19 (select main_a .cse25)) (.cse21 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse16 (select main_a v_subst_4))) (and (= .cse14 .cse15) (= 1000 .cse16) (= main_x .cse17) (= (select main_a (mod (+ .cse17 1) 256)) (select main_a main_yold)) (= .cse18 .cse19) (= .cse20 .cse15) (= .cse18 .cse20) (= .cse21 .cse19) (= .cse8 .cse21) (= .cse14 .cse16) (= 0 (select main_a .cse22))))))))) [2019-02-14 16:29:40,858 WARN L181 SmtUtils]: Spent 6.20 s on a formula simplification that was a NOOP. DAG size: 97 [2019-02-14 16:29:40,897 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {317#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-02-14 16:29:41,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {321#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is VALID [2019-02-14 16:29:43,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {321#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {325#(or (exists ((main_xold Int) (main_yold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))) (exists ((v_subst_4 Int) (v_prenex_21 Int)) (and (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a v_prenex_21)) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} is UNKNOWN [2019-02-14 16:29:45,565 INFO L273 TraceCheckUtils]: 3: Hoare triple {325#(or (exists ((main_xold Int) (main_yold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))) (exists ((v_subst_4 Int) (v_prenex_21 Int)) (and (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a v_prenex_21)) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {329#(or (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} is UNKNOWN [2019-02-14 16:29:47,589 INFO L273 TraceCheckUtils]: 4: Hoare triple {329#(or (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {333#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))))} is UNKNOWN [2019-02-14 16:29:49,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {337#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} is UNKNOWN [2019-02-14 16:29:51,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {341#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_45 Int)) (and (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ v_prenex_45 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))))))} is UNKNOWN [2019-02-14 16:29:53,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {341#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_45 Int)) (and (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ v_prenex_45 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {345#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_49 Int) (v_prenex_45 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_49) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))))))} is UNKNOWN [2019-02-14 16:29:53,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {345#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_49 Int) (v_prenex_45 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_49) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))))))} assume a[x] == 0; {308#false} is VALID [2019-02-14 16:29:53,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(a[y] == 1000); {308#false} is VALID [2019-02-14 16:29:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 11 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:29:53,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:30:37,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(a[y] == 1000); {308#false} is VALID [2019-02-14 16:30:37,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#(not (= (select main_a main_x) 0))} assume a[x] == 0; {308#false} is VALID [2019-02-14 16:30:37,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {355#(not (= (select main_a main_x) 0))} is VALID [2019-02-14 16:30:37,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:30:37,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:30:37,088 INFO L273 TraceCheckUtils]: 4: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:30:37,096 INFO L273 TraceCheckUtils]: 3: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:30:37,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:30:37,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:30:37,106 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2019-02-14 16:30:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-14 16:30:37,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:30:37,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 3] total 16 [2019-02-14 16:30:37,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:30:37,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2019-02-14 16:30:37,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:30:37,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2019-02-14 16:30:51,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 11 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2019-02-14 16:30:51,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-14 16:30:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-14 16:30:51,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=166, Unknown=44, NotChecked=0, Total=272 [2019-02-14 16:30:51,376 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 15 states. [2019-02-14 16:32:12,965 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-02-14 16:32:51,887 WARN L181 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-02-14 16:33:40,489 WARN L181 SmtUtils]: Spent 6.93 s on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-02-14 16:34:40,472 WARN L181 SmtUtils]: Spent 9.82 s on a formula simplification. DAG size of input: 87 DAG size of output: 84