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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 13:25:41,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 13:25:41,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 13:25:41,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 13:25:41,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 13:25:41,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 13:25:41,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 13:25:41,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 13:25:41,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 13:25:41,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 13:25:41,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 13:25:41,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 13:25:41,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 13:25:41,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 13:25:41,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 13:25:41,760 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 13:25:41,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 13:25:41,764 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 13:25:41,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 13:25:41,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 13:25:41,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 13:25:41,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 13:25:41,779 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 13:25:41,779 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 13:25:41,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 13:25:41,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 13:25:41,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 13:25:41,785 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 13:25:41,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 13:25:41,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 13:25:41,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 13:25:41,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 13:25:41,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 13:25:41,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 13:25:41,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 13:25:41,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 13:25:41,794 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-27 13:25:41,813 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 13:25:41,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 13:25:41,814 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 13:25:41,815 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 13:25:41,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 13:25:41,815 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 13:25:41,815 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 13:25:41,815 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 13:25:41,816 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 13:25:41,817 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-27 13:25:41,817 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-27 13:25:41,817 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 13:25:41,817 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 13:25:41,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 13:25:41,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 13:25:41,818 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 13:25:41,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 13:25:41,819 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 13:25:41,820 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 13:25:41,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 13:25:41,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 13:25:41,821 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 13:25:41,821 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 13:25:41,821 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 13:25:41,821 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 13:25:41,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 13:25:41,823 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 13:25:41,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 13:25:41,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 13:25:41,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 13:25:41,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 13:25:41,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 13:25:41,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 13:25:41,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 13:25:41,825 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 13:25:41,825 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 13:25:41,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 13:25:41,825 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 13:25:41,825 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 13:25:41,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 13:25:41,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 13:25:41,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 13:25:41,879 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 13:25:41,879 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 13:25:41,880 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-27 13:25:41,880 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-02-27 13:25:41,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 13:25:41,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 13:25:41,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 13:25:41,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 13:25:41,916 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 13:25:41,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,947 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-27 13:25:41,947 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-27 13:25:41,947 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-27 13:25:41,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 13:25:41,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 13:25:41,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 13:25:41,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 13:25:41,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/1) ... [2019-02-27 13:25:41,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 13:25:41,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 13:25:41,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 13:25:41,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 13:25:41,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (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-27 13:25:42,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-27 13:25:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-27 13:25:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-27 13:25:42,223 INFO L278 CfgBuilder]: Using library mode [2019-02-27 13:25:42,223 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-27 13:25:42,224 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:25:42 BoogieIcfgContainer [2019-02-27 13:25:42,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 13:25:42,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 13:25:42,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 13:25:42,229 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 13:25:42,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:25:41" (1/2) ... [2019-02-27 13:25:42,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520c00ba and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 01:25:42, skipping insertion in model container [2019-02-27 13:25:42,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:25:42" (2/2) ... [2019-02-27 13:25:42,232 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-02-27 13:25:42,242 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 13:25:42,250 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-27 13:25:42,261 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-27 13:25:42,290 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 13:25:42,291 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 13:25:42,291 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 13:25:42,291 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 13:25:42,291 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 13:25:42,291 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 13:25:42,291 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 13:25:42,292 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 13:25:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-27 13:25:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 13:25:42,314 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:25:42,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 13:25:42,317 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:25:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:25:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-02-27 13:25:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:25:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:25:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:25:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:25:42,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:25:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:25:42,734 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-02-27 13:25:42,836 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-27 13:25:42,842 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-27 13:25:42,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-02-27 13:25:42,844 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-27 13:25:42,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 13:25:42,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 13:25:42,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 13:25:42,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 13:25:42,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:25:42,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 13:25:42,892 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-27 13:25:42,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 13:25:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 13:25:42,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 13:25:42,902 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-27 13:25:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:25:43,146 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-27 13:25:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 13:25:43,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 13:25:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:25:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 13:25:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-02-27 13:25:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 13:25:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-02-27 13:25:43,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-02-27 13:25:43,212 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-27 13:25:43,223 INFO L225 Difference]: With dead ends: 15 [2019-02-27 13:25:43,223 INFO L226 Difference]: Without dead ends: 5 [2019-02-27 13:25:43,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 13:25:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-27 13:25:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-27 13:25:43,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:25:43,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-27 13:25:43,321 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-27 13:25:43,321 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-27 13:25:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:25:43,325 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-27 13:25:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 13:25:43,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:25:43,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:25:43,326 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-27 13:25:43,326 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-27 13:25:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:25:43,327 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-27 13:25:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 13:25:43,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:25:43,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:25:43,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:25:43,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:25:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-27 13:25:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-27 13:25:43,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-27 13:25:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:25:43,336 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-27 13:25:43,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 13:25:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 13:25:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 13:25:43,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:25:43,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 13:25:43,338 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:25:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:25:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-02-27 13:25:43,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:25:43,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:25:43,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:25:43,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:25:43,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:25:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:25:43,604 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-27 13:25:43,614 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-27 13:25:43,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-02-27 13:25:43,631 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-27 13:25:43,631 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-27 13:25:43,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:25:43,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:25:43,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-27 13:25:43,635 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-02-27 13:25:43,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-27 13:25:43,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 13:25:48,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 13:25:48,644 INFO L272 AbstractInterpreter]: Visited 4 different actions 9 times. Merged at 3 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-27 13:25:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:25:48,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 13:25:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:25:48,650 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-27 13:25:48,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:25:48,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 13:25:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:25:48,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-27 13:25:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:25:48,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 13:25:48,769 INFO L467 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-27 13:25:48,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:48,795 INFO L467 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 15 [2019-02-27 13:25:48,798 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 13:25:48,813 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:25:48,852 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:25:48,852 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-27 13:25:48,866 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:25:48,866 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-27 13:25:48,867 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-27 13:25:49,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,144 INFO L467 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 52 [2019-02-27 13:25:49,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,289 INFO L467 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 44 treesize of output 64 [2019-02-27 13:25:49,307 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:25:49,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,458 INFO L467 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 80 [2019-02-27 13:25:49,461 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-27 13:25:49,573 INFO L301 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:25:49,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,659 INFO L467 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 51 [2019-02-27 13:25:49,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,676 INFO L467 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 43 treesize of output 60 [2019-02-27 13:25:49,688 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:25:49,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:25:49,759 INFO L467 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 76 [2019-02-27 13:25:49,768 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-27 13:25:49,812 INFO L301 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:25:49,879 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-02-27 13:25:49,966 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-27 13:25:49,967 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:42, output treesize:72 [2019-02-27 13:25:52,020 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:25:52,021 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-27 13:25:52,021 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4]. (let ((.cse1 (select main_a main_x))) (or (let ((.cse0 (select main_a (+ main_x (- 1))))) (and (= main_x (mod main_x 256)) (= 1000 .cse0) (= (select main_a (mod (+ main_x 1) 256)) (select main_a v_prenex_4)) (= .cse1 .cse0))) (let ((.cse2 (select main_a main_xold)) (.cse3 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse1 .cse2) (= 0 (select main_a .cse3)) (= .cse2 1000) (= main_x (mod .cse3 256)))))) [2019-02-27 13:25:52,154 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-27 13:25:54,171 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-27 13:25:54,185 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-27 13:25:54,186 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-27 13:25:54,186 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-27 13:25:54,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 13:25:54,274 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-02-27 13:25:54,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-02-27 13:25:54,276 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-27 13:25:54,278 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-27 13:25:54,278 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-27 13:25:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 13:25:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-27 13:25:54,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 13:25:54,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-27 13:25:54,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:25:54,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 13:25:56,334 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-27 13:25:56,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 13:25:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 13:25:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-27 13:25:56,335 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-02-27 13:26:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:26:00,427 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-27 13:26:00,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 13:26:00,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-27 13:26:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:26:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 13:26:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-27 13:26:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 13:26:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-27 13:26:00,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-02-27 13:26:02,469 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-27 13:26:02,469 INFO L225 Difference]: With dead ends: 8 [2019-02-27 13:26:02,469 INFO L226 Difference]: Without dead ends: 6 [2019-02-27 13:26:02,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-27 13:26:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-27 13:26:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-27 13:26:02,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:26:02,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-02-27 13:26:02,479 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-27 13:26:02,479 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-27 13:26:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:26:02,483 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-27 13:26:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-27 13:26:02,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:26:02,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:26:02,483 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-27 13:26:02,483 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-27 13:26:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:26:02,484 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-27 13:26:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-27 13:26:02,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:26:02,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:26:02,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:26:02,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:26:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 13:26:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-27 13:26:02,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-27 13:26:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:26:02,487 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-27 13:26:02,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-27 13:26:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-27 13:26:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-27 13:26:02,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:26:02,487 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-27 13:26:02,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:26:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:26:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-02-27 13:26:02,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:26:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:26:02,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:26:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:26:02,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:26:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:26:02,713 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-27 13:26:02,715 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-27 13:26:02,717 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-27 13:26:02,718 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2019-02-27 13:26:02,718 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-02-27 13:26:02,719 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-27 13:26:02,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:26:02,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:26:02,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 13:26:02,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 13:26:02,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:26:02,720 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-27 13:26:02,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-27 13:26:02,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-27 13:26:02,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-27 13:26:02,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-27 13:26:02,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-27 13:26:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:26:02,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 13:26:02,771 INFO L467 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-27 13:26:02,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,781 INFO L467 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 15 [2019-02-27 13:26:02,790 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:02,799 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:02,808 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:02,808 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-27 13:26:02,811 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:02,812 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-27 13:26:02,812 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-27 13:26:02,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,914 INFO L467 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 47 [2019-02-27 13:26:02,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,937 INFO L467 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 41 treesize of output 60 [2019-02-27 13:26:02,940 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:02,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:02,997 INFO L467 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-27 13:26:03,000 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:03,036 INFO L301 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:26:03,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,118 INFO L467 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 48 [2019-02-27 13:26:03,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,142 INFO L467 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 40 treesize of output 52 [2019-02-27 13:26:03,146 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:03,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:03,225 INFO L467 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 64 [2019-02-27 13:26:03,232 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:03,275 INFO L301 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:26:03,325 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-02-27 13:26:03,395 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-27 13:26:03,395 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:45, output treesize:78 [2019-02-27 13:26:05,455 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:05,455 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-27 13:26:05,455 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, v_prenex_8, main_yold]. (let ((.cse3 (select main_a main_y)) (.cse0 (select main_a main_x))) (or (let ((.cse1 (select main_a main_xold)) (.cse2 (+ main_xold 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= main_x (mod .cse2 256)) (= .cse3 (select main_a v_prenex_8)) (= main_y (mod (+ main_xold 2) 256)))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= .cse3 (select main_a main_yold)) (= 1000 .cse4) (= .cse0 .cse4))))) [2019-02-27 13:26:05,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:05,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:05,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:05,783 INFO L467 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-27 13:26:05,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:05,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:05,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:05,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:05,845 INFO L467 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-27 13:26:05,849 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:05,900 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:06,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,017 INFO L467 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-27 13:26:06,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,048 INFO L467 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-27 13:26:06,052 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:06,089 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:06,143 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:26:06,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,362 INFO L467 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 108 [2019-02-27 13:26:06,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,437 INFO L467 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 51 treesize of output 153 [2019-02-27 13:26:06,455 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:06,525 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:06,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,633 INFO L467 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 111 [2019-02-27 13:26:06,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:06,702 INFO L467 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 55 treesize of output 150 [2019-02-27 13:26:06,710 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:06,790 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:06,851 INFO L301 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:26:06,908 INFO L301 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-27 13:26:06,909 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:125, output treesize:113 [2019-02-27 13:26:09,088 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:09,088 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-27 13:26:09,089 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1, main_yold, main_xold, v_prenex_12]. (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 ((.cse5 (select main_a main_xold)) (.cse7 (mod (+ main_xold 1) 256)) (.cse6 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse5 .cse6) (= .cse4 .cse5) (= main_x .cse7) (= (select main_a (mod (+ .cse7 1) 256)) (select main_a v_prenex_12)) (= 1000 .cse6))))) [2019-02-27 13:26:09,269 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-27 13:26:11,281 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-27 13:26:13,339 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_12 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_12)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} is UNKNOWN [2019-02-27 13:26:13,383 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_12 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_12)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} assume a[x] == 0; {110#false} is VALID [2019-02-27 13:26:13,384 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-02-27 13:26:13,384 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-27 13:26:13,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 13:26:15,538 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-02-27 13:26:15,539 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2019-02-27 13:26:15,540 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-27 13:26:15,545 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-27 13:26:15,547 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-27 13:26:15,547 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-27 13:26:15,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 13:26:15,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-02-27 13:26:15,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 13:26:15,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-27 13:26:15,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:26:15,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-27 13:26:19,699 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-27 13:26:19,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-27 13:26:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-27 13:26:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-27 13:26:19,701 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-02-27 13:26:29,303 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-02-27 13:26:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:26:33,457 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-02-27 13:26:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-27 13:26:33,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-27 13:26:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:26:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 13:26:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-02-27 13:26:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 13:26:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-02-27 13:26:33,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-02-27 13:26:37,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 10 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-02-27 13:26:37,505 INFO L225 Difference]: With dead ends: 10 [2019-02-27 13:26:37,505 INFO L226 Difference]: Without dead ends: 8 [2019-02-27 13:26:37,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-27 13:26:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-27 13:26:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-27 13:26:37,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:26:37,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-27 13:26:37,562 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-27 13:26:37,562 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-27 13:26:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:26:37,563 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-27 13:26:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-27 13:26:37,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:26:37,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:26:37,564 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-27 13:26:37,564 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-27 13:26:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:26:37,565 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-27 13:26:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-27 13:26:37,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:26:37,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:26:37,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:26:37,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:26:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 13:26:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-27 13:26:37,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-27 13:26:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:26:37,567 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-27 13:26:37,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-27 13:26:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-27 13:26:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-27 13:26:37,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:26:37,568 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-27 13:26:37,568 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:26:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:26:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-02-27 13:26:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:26:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:26:37,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-27 13:26:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:26:37,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:26:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:26:38,333 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-02-27 13:26:38,425 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-27 13:26:38,435 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-27 13:26:38,438 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-27 13:26:38,440 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-27 13:26:38,441 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-27 13:26:38,442 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-27 13:26:38,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-02-27 13:26:38,443 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-27 13:26:38,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:26:38,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:26:38,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 13:26:38,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 13:26:38,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:26:38,444 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-27 13:26:38,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-27 13:26:38,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-27 13:26:38,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-27 13:26:38,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-27 13:26:38,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-27 13:26:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:26:38,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 13:26:38,622 INFO L467 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-27 13:26:38,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,630 INFO L467 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 15 [2019-02-27 13:26:38,632 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:38,637 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:38,645 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:38,646 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-27 13:26:38,649 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:38,649 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-27 13:26:38,649 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-27 13:26:38,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,730 INFO L467 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 36 [2019-02-27 13:26:38,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,745 INFO L467 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 27 treesize of output 42 [2019-02-27 13:26:38,747 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:38,762 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:38,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,818 INFO L467 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 46 [2019-02-27 13:26:38,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:38,837 INFO L467 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 30 treesize of output 59 [2019-02-27 13:26:38,845 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:38,876 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:38,900 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:26:38,943 INFO L301 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-27 13:26:38,943 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-02-27 13:26:41,150 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:41,150 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-27 13:26:41,150 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-27 13:26:41,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,342 INFO L467 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 43 treesize of output 55 [2019-02-27 13:26:41,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,396 INFO L467 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-27 13:26:41,400 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:41,422 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:41,443 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:41,683 WARN L296 Elim1Store]: Array PQE input equivalent to false [2019-02-27 13:26:41,684 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:41,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,846 INFO L467 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 52 treesize of output 86 [2019-02-27 13:26:41,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:41,937 INFO L467 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 43 treesize of output 98 [2019-02-27 13:26:41,941 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:41,985 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:42,007 INFO L301 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:42,067 INFO L301 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-27 13:26:42,068 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:157, output treesize:123 [2019-02-27 13:26:44,099 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:44,100 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_21, v_subst_2, v_prenex_14, 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_14 main_xold)) (.cse7 (mod (+ main_xold 1) 256)) (.cse9 (select v_prenex_14 (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= (let ((.cse6 (store v_prenex_14 main_x .cse8))) (store .cse6 main_y (select .cse6 .cse7))) main_a) (= (select v_prenex_14 .cse7) .cse9) (= main_x .cse7) (= .cse8 .cse9) (= main_y (mod (+ .cse7 1) 256)) (= .cse9 1000)))) [2019-02-27 13:26:44,100 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, main_xold]. (let ((.cse2 (select main_a main_x))) (or (let ((.cse3 (mod (+ v_subst_2 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a (mod v_subst_2 256)))) (and (= .cse0 1000) (= (select main_a main_y) .cse1) (= .cse2 .cse1) (= 0 (select main_a v_subst_2)) (= (mod (+ .cse3 1) 256) main_y) (= main_x .cse3) (= .cse0 .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) (= .cse2 .cse4) (= main_x .cse6) (= main_y .cse7) (= 1000 .cse5) (= .cse4 (select main_a .cse7))))))) [2019-02-27 13:26:44,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,379 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 150 [2019-02-27 13:26:44,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,440 INFO L467 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 67 treesize of output 166 [2019-02-27 13:26:44,444 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:44,533 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:44,604 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:44,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,871 INFO L467 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 64 treesize of output 141 [2019-02-27 13:26:44,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:44,898 INFO L467 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-27 13:26:44,903 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:44,947 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:44,970 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:45,078 INFO L301 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-27 13:26:45,079 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:223, output treesize:171 [2019-02-27 13:26:47,180 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:47,180 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_16, v_subst_2, v_main_a_22, v_subst_3]. (or (let ((.cse5 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (select v_prenex_16 .cse5)) (.cse2 (mod (+ .cse5 1) 256)) (.cse0 (select v_prenex_16 (mod v_subst_2 256))) (.cse4 (select v_prenex_16 (+ v_subst_2 (- 1))))) (and (= .cse0 .cse1) (= (select v_prenex_16 .cse2) .cse0) (= (mod (+ .cse2 1) 256) main_y) (= main_a (let ((.cse3 (store v_prenex_16 main_x .cse1))) (store .cse3 main_y (select .cse3 .cse2)))) (= .cse2 main_x) (= (select v_prenex_16 v_subst_2) 0) (= .cse4 .cse0) (= 1000 .cse4)))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse8 (select v_main_a_22 v_subst_3)) (.cse6 (mod (+ .cse11 1) 256)) (.cse9 (select v_main_a_22 .cse11)) (.cse7 (select v_main_a_22 (+ v_subst_3 (- 1))))) (and (= .cse6 main_x) (= .cse7 .cse8) (= .cse9 .cse8) (= (select v_main_a_22 .cse6) .cse8) (= v_subst_3 (mod v_subst_3 256)) (= main_y (mod (+ .cse6 1) 256)) (= (let ((.cse10 (store v_main_a_22 main_x .cse9))) (store .cse10 main_y (select .cse10 .cse6))) main_a) (= .cse7 1000))))) [2019-02-27 13:26:47,180 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse2 (select main_a main_y))) (or (let ((.cse5 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (mod (+ .cse5 1) 256)) (.cse3 (select main_a .cse5)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse4 (select main_a (mod v_subst_2 256)))) (and (= .cse0 1000) (= (mod (+ .cse1 1) 256) main_y) (= .cse1 main_x) (= .cse2 .cse3) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) .cse3) (= .cse4 .cse3) (= .cse0 .cse4)))) (let ((.cse9 (mod (+ v_subst_3 1) 256))) (let ((.cse6 (mod (+ .cse9 1) 256)) (.cse8 (select main_a .cse9)) (.cse7 (select main_a v_subst_3))) (and (= .cse6 main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= .cse7 .cse8) (= main_y (mod (+ .cse6 1) 256)) (= .cse2 .cse8) (= (select main_a .cse6) .cse8) (= .cse7 1000)))))) [2019-02-27 13:26:47,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,668 INFO L467 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 95 treesize of output 194 [2019-02-27 13:26:47,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:47,746 INFO L467 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-27 13:26:47,751 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:47,830 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:47,873 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:49,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,385 INFO L292 Elim1Store]: Index analysis took 361 ms [2019-02-27 13:26:49,386 INFO L467 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 108 treesize of output 251 [2019-02-27 13:26:49,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:26:49,466 INFO L467 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 96 treesize of output 291 [2019-02-27 13:26:49,469 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:26:49,757 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:49,879 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:26:50,249 INFO L301 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-27 13:26:50,249 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:311, output treesize:249 [2019-02-27 13:26:52,273 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:26:52,273 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_23, v_subst_2, v_prenex_17, v_subst_3]. (or (let ((.cse7 (mod (+ v_subst_2 1) 256))) (let ((.cse6 (mod (+ .cse7 1) 256))) (let ((.cse2 (select v_main_a_23 (mod v_subst_2 256))) (.cse0 (select v_main_a_23 .cse6)) (.cse3 (select v_main_a_23 (+ v_subst_2 (- 1)))) (.cse1 (select v_main_a_23 .cse7)) (.cse4 (mod (+ .cse6 1) 256))) (and (= .cse0 .cse1) (= .cse2 .cse3) (= 0 (select v_main_a_23 v_subst_2)) (= .cse2 .cse1) (= .cse4 main_x) (= main_y (mod (+ .cse4 1) 256)) (= (let ((.cse5 (store v_main_a_23 main_x .cse0))) (store .cse5 main_y (select .cse5 .cse4))) main_a) (= .cse3 1000) (= .cse1 (select v_main_a_23 .cse4)))))) (let ((.cse13 (mod (+ v_subst_3 1) 256))) (let ((.cse14 (mod (+ .cse13 1) 256))) (let ((.cse10 (select v_prenex_17 v_subst_3)) (.cse11 (select v_prenex_17 .cse14)) (.cse8 (mod (+ .cse14 1) 256)) (.cse9 (select v_prenex_17 .cse13))) (and (= main_y (mod (+ .cse8 1) 256)) (= .cse9 .cse10) (= .cse9 .cse11) (= v_subst_3 (mod v_subst_3 256)) (= 1000 (select v_prenex_17 (+ v_subst_3 (- 1)))) (= 1000 .cse10) (= (let ((.cse12 (store v_prenex_17 main_x .cse11))) (store .cse12 main_y (select .cse12 .cse8))) main_a) (= main_x .cse8) (= (select v_prenex_17 .cse8) .cse9)))))) [2019-02-27 13:26:52,273 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse4 (select main_a main_x))) (or (let ((.cse6 (mod (+ v_subst_2 1) 256))) (let ((.cse7 (mod (+ .cse6 1) 256))) (let ((.cse2 (mod (+ .cse7 1) 256))) (let ((.cse3 (mod (+ .cse2 1) 256)) (.cse1 (select main_a .cse7)) (.cse0 (select main_a .cse6)) (.cse5 (select main_a (mod v_subst_2 256)))) (and (= .cse0 .cse1) (= .cse2 main_x) (= main_y .cse3) (= (select main_a .cse3) .cse1) (= 0 (select main_a v_subst_2)) (= .cse4 .cse1) (= .cse5 .cse0) (= 1000 .cse0) (= (select main_a (+ v_subst_2 (- 1))) .cse5)))))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse12 (mod (+ .cse11 1) 256))) (let ((.cse8 (mod (+ .cse12 1) 256)) (.cse9 (select main_a .cse12)) (.cse10 (select main_a .cse11))) (and (= main_y (mod (+ .cse8 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= .cse9 .cse4) (= v_subst_3 (mod v_subst_3 256)) (= .cse9 (select main_a main_y)) (= .cse10 1000) (= main_x .cse8) (= .cse9 .cse10) (= (select main_a v_subst_3) 1000))))))) [2019-02-27 13:26:56,977 WARN L181 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-02-27 13:26:57,035 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-27 13:26:59,044 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-27 13:27:01,053 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))) (= (select main_a main_x) (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))))) (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-27 13:27:03,064 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))) (= (select main_a main_x) (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))))) (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) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a main_y) (select main_a (mod (+ v_subst_2 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ v_subst_2 1) 256))) (= (select main_a (mod v_subst_2 256)) (select main_a (mod (+ v_subst_2 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (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-27 13:27:05,078 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) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a main_y) (select main_a (mod (+ v_subst_2 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ v_subst_2 1) 256))) (= (select main_a (mod v_subst_2 256)) (select main_a (mod (+ v_subst_2 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (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 (mod (+ v_subst_3 1) 256)) 1000) (= 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 (mod (+ v_subst_2 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (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 v_subst_2 256)) (select main_a (mod (+ v_subst_2 1) 256))) (= 1000 (select main_a (mod (+ v_subst_2 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} is UNKNOWN [2019-02-27 13:27:05,084 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 (mod (+ v_subst_3 1) 256)) 1000) (= 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 (mod (+ v_subst_2 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (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 v_subst_2 256)) (select main_a (mod (+ v_subst_2 1) 256))) (= 1000 (select main_a (mod (+ v_subst_2 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-27 13:27:05,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2019-02-27 13:27:05,085 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-27 13:27:05,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 13:27:12,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-02-27 13:27:12,466 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-27 13:27:12,468 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-27 13:27:12,487 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-27 13:27:13,339 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-27 13:27:13,747 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-27 13:27:13,749 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-27 13:27:13,750 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-27 13:27:13,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 13:27:13,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-02-27 13:27:13,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 13:27:13,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-27 13:27:13,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:27:13,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-02-27 13:27:20,218 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-27 13:27:20,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-27 13:27:20,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-27 13:27:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-27 13:27:20,220 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-02-27 13:27:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:27:57,554 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-02-27 13:27:57,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-27 13:27:57,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-27 13:27:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:27:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-27 13:27:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-27 13:27:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-27 13:27:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-02-27 13:27:57,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2019-02-27 13:28:04,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 15 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-02-27 13:28:04,232 INFO L225 Difference]: With dead ends: 15 [2019-02-27 13:28:04,232 INFO L226 Difference]: Without dead ends: 12 [2019-02-27 13:28:04,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-27 13:28:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-27 13:28:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-27 13:28:04,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:28:04,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-02-27 13:28:04,294 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-27 13:28:04,294 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-27 13:28:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:28:04,296 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-27 13:28:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-27 13:28:04,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:28:04,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:28:04,297 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-27 13:28:04,297 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-27 13:28:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:28:04,298 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-27 13:28:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-27 13:28:04,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:28:04,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:28:04,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:28:04,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:28:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-27 13:28:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-27 13:28:04,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-02-27 13:28:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:28:04,301 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-27 13:28:04,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-27 13:28:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-27 13:28:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-27 13:28:04,301 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:28:04,301 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-27 13:28:04,302 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:28:04,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:28:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2019-02-27 13:28:04,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:28:04,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:28:04,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-27 13:28:04,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:28:04,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:28:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:28:05,279 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-02-27 13:28:05,504 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a main_y)) (<= main_y (+ main_x 1)))} is VALID [2019-02-27 13:28:05,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a 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]]; {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} is VALID [2019-02-27 13:28:05,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-02-27 13:28:05,513 INFO L273 TraceCheckUtils]: 3: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-02-27 13:28:05,514 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-02-27 13:28:05,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-02-27 13:28:05,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-02-27 13:28:05,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (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]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-02-27 13:28:05,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (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]]; {319#(not (= 0 (select main_a main_x)))} is VALID [2019-02-27 13:28:05,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(not (= 0 (select main_a main_x)))} assume a[x] == 0; {314#false} is VALID [2019-02-27 13:28:05,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-02-27 13:28:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-02-27 13:28:05,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:28:05,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:28:05,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 13:28:05,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 13:28:05,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:28:05,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-27 13:28:05,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:28:05,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 13:28:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:28:07,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-27 13:28:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:28:08,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 13:28:08,488 INFO L467 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-27 13:28:08,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,504 INFO L467 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 15 [2019-02-27 13:28:08,505 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:08,515 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:08,525 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:08,525 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-02-27 13:28:08,527 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:28:08,528 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-27 13:28:08,528 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-27 13:28:08,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,662 INFO L467 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 46 [2019-02-27 13:28:08,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,688 INFO L467 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 30 treesize of output 59 [2019-02-27 13:28:08,691 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:08,715 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:08,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,770 INFO L467 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 36 [2019-02-27 13:28:08,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:08,782 INFO L467 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 27 treesize of output 42 [2019-02-27 13:28:08,785 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:08,802 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:08,827 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-27 13:28:08,865 INFO L301 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-27 13:28:08,866 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-02-27 13:28:10,930 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:28:10,931 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_29, main_yold]. (let ((.cse0 (select v_main_a_29 (+ main_yold (- 1))))) (and (= 0 (select v_main_a_29 main_yold)) (= .cse0 1000) (= (mod main_yold 256) main_x) (= main_y (mod (+ main_yold 1) 256)) (= (let ((.cse1 (store v_main_a_29 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a))) [2019-02-27 13:28:10,931 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-27 13:28:11,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,097 INFO L467 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 43 treesize of output 55 [2019-02-27 13:28:11,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,119 INFO L467 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-27 13:28:11,122 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:11,146 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:11,166 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:11,291 WARN L296 Elim1Store]: Array PQE input equivalent to false [2019-02-27 13:28:11,292 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:11,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,346 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 13:28:11,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,357 INFO L467 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 52 treesize of output 102 [2019-02-27 13:28:11,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:11,388 INFO L467 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 47 treesize of output 118 [2019-02-27 13:28:11,390 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:11,438 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:11,480 INFO L301 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:11,539 INFO L301 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-27 13:28:11,539 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-02-27 13:28:13,569 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:28:13,570 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_20, main_xold, v_main_a_30, v_subst_4]. (or (let ((.cse1 (mod (+ main_xold 1) 256)) (.cse2 (select v_prenex_20 main_xold)) (.cse3 (select v_prenex_20 (+ main_xold (- 1))))) (and (= main_a (let ((.cse0 (store v_prenex_20 main_x .cse2))) (store .cse0 main_y (select .cse0 .cse1)))) (= main_xold (mod main_xold 256)) (= (select v_prenex_20 .cse1) .cse3) (= 1000 .cse3) (= main_x .cse1) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 .cse3))) (let ((.cse9 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse4 (select v_main_a_30 v_subst_4)) (.cse8 (select v_main_a_30 .cse9)) (.cse6 (select v_main_a_30 (+ v_subst_4 (- 1))))) (and (= .cse4 (select v_main_a_30 .cse5)) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (let ((.cse7 (store v_main_a_30 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse5))) main_a) (= .cse4 0) (= main_x (mod (+ .cse9 1) 256)) (= .cse8 .cse6))))) [2019-02-27 13:28:13,570 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, main_xold]. (or (let ((.cse3 (mod v_subst_4 256))) (let ((.cse1 (mod (+ v_subst_4 1) 256)) (.cse2 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (select main_a .cse3))) (and (= .cse0 (select main_a .cse1)) (= 0 (select main_a v_subst_4)) (= 1000 .cse2) (= main_y (mod (+ .cse1 1) 256)) (= .cse0 .cse2) (= main_x (mod (+ .cse3 1) 256)) (= .cse0 (select main_a main_y))))) (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-27 13:28:13,872 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 13:28:13,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:13,917 INFO L467 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 118 treesize of output 191 [2019-02-27 13:28:14,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:14,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:14,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:14,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:14,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:14,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:14,408 INFO L467 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 67 treesize of output 166 [2019-02-27 13:28:14,415 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:14,535 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:14,746 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:15,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,043 INFO L467 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 64 treesize of output 109 [2019-02-27 13:28:15,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:15,070 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 127 [2019-02-27 13:28:15,076 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:15,126 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:15,150 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:15,274 INFO L301 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-27 13:28:15,274 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2019-02-27 13:28:17,302 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:28:17,302 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_22, v_subst_4, v_main_a_31, v_subst_5]. (or (let ((.cse3 (mod (+ v_subst_4 1) 256)) (.cse6 (mod v_subst_4 256))) (let ((.cse0 (select v_prenex_22 (+ v_subst_4 (- 1)))) (.cse2 (select v_prenex_22 .cse6)) (.cse1 (mod (+ .cse3 1) 256)) (.cse5 (mod (+ .cse6 1) 256))) (and (= (select v_prenex_22 v_subst_4) 0) (= .cse0 1000) (= (select v_prenex_22 .cse1) .cse2) (= main_y (mod (+ .cse1 1) 256)) (= .cse0 .cse2) (= (select v_prenex_22 .cse3) .cse2) (= (let ((.cse4 (store v_prenex_22 main_x (select v_prenex_22 .cse5)))) (store .cse4 main_y (select .cse4 .cse1))) main_a) (= main_x (mod (+ .cse5 1) 256))))) (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse11 (select v_main_a_31 (+ v_subst_5 (- 1)))) (.cse7 (select v_main_a_31 v_subst_5)) (.cse10 (select v_main_a_31 .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= .cse7 (select v_main_a_31 .cse8)) (= (let ((.cse9 (store v_main_a_31 main_x .cse10))) (store .cse9 main_y (select .cse9 .cse8))) main_a) (= .cse7 .cse11) (= 1000 .cse11) (= .cse7 .cse10) (= main_y (mod (+ .cse8 1) 256)) (= main_x .cse8) (= v_subst_5 (mod v_subst_5 256)))))) [2019-02-27 13:28:17,302 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse2 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_5 1) 256))) (let ((.cse0 (select main_a .cse4)) (.cse3 (select main_a v_subst_5)) (.cse1 (mod (+ .cse4 1) 256))) (and (= .cse0 (select main_a .cse1)) (= .cse0 .cse2) (= .cse3 .cse0) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= main_y (mod (+ .cse1 1) 256)) (= .cse3 1000) (= main_x .cse1) (= v_subst_5 (mod v_subst_5 256))))) (let ((.cse9 (mod (+ v_subst_4 1) 256))) (let ((.cse5 (select main_a (mod v_subst_4 256))) (.cse7 (select main_a (+ v_subst_4 (- 1)))) (.cse8 (mod (+ .cse9 1) 256)) (.cse6 (select main_a .cse9))) (and (= .cse5 .cse6) (= 0 (select main_a v_subst_4)) (= 1000 .cse7) (= main_y (mod (+ .cse8 1) 256)) (= .cse5 .cse7) (= .cse6 .cse2) (= main_x .cse8) (= .cse6 (select main_a main_x))))))) [2019-02-27 13:28:19,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,615 INFO L467 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 97 treesize of output 196 [2019-02-27 13:28:19,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:19,676 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 214 [2019-02-27 13:28:19,681 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:19,753 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:19,792 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:23,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:23,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,090 INFO L292 Elim1Store]: Index analysis took 562 ms [2019-02-27 13:28:24,091 INFO L467 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 108 treesize of output 251 [2019-02-27 13:28:24,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:24,289 INFO L467 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 96 treesize of output 275 [2019-02-27 13:28:24,293 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:24,567 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:24,631 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:24,797 INFO L301 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-27 13:28:24,798 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2019-02-27 13:28:26,863 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:28:26,863 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_24, v_subst_5, v_main_a_32, v_subst_4]. (or (let ((.cse6 (mod (+ v_subst_5 1) 256))) (let ((.cse5 (mod (+ .cse6 1) 256))) (let ((.cse2 (select v_prenex_24 .cse6)) (.cse3 (select v_prenex_24 .cse5)) (.cse0 (mod (+ .cse5 1) 256)) (.cse1 (select v_prenex_24 v_subst_5))) (and (= main_x .cse0) (= .cse1 .cse2) (= (select v_prenex_24 .cse0) .cse2) (= .cse3 .cse2) (= (let ((.cse4 (store v_prenex_24 main_x .cse3))) (store .cse4 main_y (select .cse4 .cse0))) main_a) (= .cse1 1000) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse0 1) 256)) (= .cse1 (select v_prenex_24 (+ v_subst_5 (- 1)))))))) (let ((.cse14 (mod (+ v_subst_4 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse8 (select v_main_a_32 (+ v_subst_4 (- 1)))) (.cse10 (select v_main_a_32 (mod v_subst_4 256))) (.cse7 (mod (+ .cse13 1) 256)) (.cse9 (select v_main_a_32 .cse14)) (.cse12 (select v_main_a_32 .cse13))) (and (= (mod (+ .cse7 1) 256) main_y) (= (select v_main_a_32 v_subst_4) 0) (= 1000 .cse8) (= .cse9 .cse10) (= .cse8 .cse10) (= (select v_main_a_32 .cse7) .cse9) (= main_x .cse7) (= (let ((.cse11 (store v_main_a_32 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse7))) main_a) (= .cse9 .cse12)))))) [2019-02-27 13:28:26,863 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse5 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse6 (mod (+ .cse7 1) 256))) (let ((.cse2 (select main_a v_subst_5)) (.cse1 (select main_a .cse6)) (.cse0 (select main_a .cse7)) (.cse3 (mod (+ .cse6 1) 256))) (and (= .cse0 .cse1) (= .cse2 .cse0) (= .cse2 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse3) (= .cse1 .cse4) (= .cse1 .cse5) (= v_subst_5 (mod v_subst_5 256)) (= .cse0 1000) (= main_y (mod (+ .cse3 1) 256)))))) (let ((.cse13 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse11 (select main_a (+ v_subst_4 (- 1)))) (.cse9 (select main_a .cse13)) (.cse10 (select main_a .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= (mod (+ .cse8 1) 256) main_y) (= .cse9 .cse10) (= 0 (select main_a v_subst_4)) (= 1000 .cse11) (= .cse5 .cse10) (= (select main_a (mod v_subst_4 256)) .cse11) (= .cse9 1000) (= .cse4 .cse10) (= main_x .cse8))))))) [2019-02-27 13:28:33,724 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 64 [2019-02-27 13:28:33,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 337 [2019-02-27 13:28:33,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:33,935 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 367 [2019-02-27 13:28:33,946 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:34,096 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:34,144 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:39,019 WARN L146 IndexEqualityManager]: solver failed to check if following equality is implied: (= main_x (mod (+ v_subst_4 1) 256)) [2019-02-27 13:28:39,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:39,867 INFO L292 Elim1Store]: Index analysis took 2856 ms [2019-02-27 13:28:39,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 402 [2019-02-27 13:28:40,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:40,095 INFO L292 Elim1Store]: Index analysis took 193 ms [2019-02-27 13:28:40,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 438 [2019-02-27 13:28:40,103 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:40,837 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:41,347 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:42,635 INFO L301 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-27 13:28:42,636 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2019-02-27 13:28:44,672 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:28:44,673 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_25, v_subst_5, v_main_a_33, v_subst_4]. (or (let ((.cse6 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse6 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse0 (select v_prenex_25 .cse8)) (.cse2 (mod (+ .cse7 1) 256)) (.cse4 (select v_prenex_25 .cse7)) (.cse3 (select v_prenex_25 v_subst_5)) (.cse1 (select v_prenex_25 .cse6))) (and (= .cse0 .cse1) (= .cse0 (select v_prenex_25 .cse2)) (= main_x .cse2) (= .cse3 (select v_prenex_25 (+ v_subst_5 (- 1)))) (= .cse0 .cse4) (= main_y (mod (+ .cse2 1) 256)) (= 1000 .cse1) (= main_a (let ((.cse5 (store v_prenex_25 main_x .cse4))) (store .cse5 main_y (select .cse5 .cse2)))) (= v_subst_5 (mod v_subst_5 256)) (= .cse3 .cse1)))))) (let ((.cse16 (mod (+ v_subst_4 1) 256))) (let ((.cse17 (mod (+ .cse16 1) 256))) (let ((.cse15 (mod (+ .cse17 1) 256))) (let ((.cse13 (select v_main_a_33 (+ v_subst_4 (- 1)))) (.cse11 (select v_main_a_33 .cse17)) (.cse10 (select v_main_a_33 .cse16)) (.cse9 (mod (+ .cse15 1) 256)) (.cse12 (select v_main_a_33 .cse15))) (and (= main_y (mod (+ .cse9 1) 256)) (= .cse10 1000) (= .cse11 (select v_main_a_33 .cse9)) (= (select v_main_a_33 v_subst_4) 0) (= .cse11 .cse12) (= (select v_main_a_33 (mod v_subst_4 256)) .cse13) (= .cse9 main_x) (= 1000 .cse13) (= .cse11 .cse10) (= (let ((.cse14 (store v_main_a_33 main_x .cse12))) (store .cse14 main_y (select .cse14 .cse9))) main_a))))))) [2019-02-27 13:28:44,673 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse6 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse3 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse3 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse1 (select main_a .cse8)) (.cse2 (select main_a .cse7)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse7 1) 256))) (and (= main_y (mod (+ .cse0 1) 256)) (= 1000 .cse1) (= .cse2 .cse1) (= (select main_a .cse3) .cse1) (= .cse2 .cse4) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= .cse2 .cse6) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse0 main_x)))))) (let ((.cse14 (mod (+ v_subst_5 1) 256))) (let ((.cse16 (mod (+ .cse14 1) 256))) (let ((.cse15 (mod (+ .cse16 1) 256))) (let ((.cse11 (select main_a v_subst_5)) (.cse9 (select main_a .cse15)) (.cse13 (select main_a .cse16)) (.cse10 (mod (+ .cse15 1) 256)) (.cse12 (select main_a .cse14))) (and (= .cse9 .cse6) (= main_x .cse10) (= .cse11 .cse12) (= .cse11 (select main_a (+ v_subst_5 (- 1)))) (= .cse13 1000) (= .cse9 .cse4) (= .cse9 .cse13) (= main_y (mod (+ .cse10 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= .cse12 1000)))))))) [2019-02-27 13:28:58,869 WARN L181 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-02-27 13:28:58,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:58,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:58,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,289 INFO L292 Elim1Store]: Index analysis took 343 ms [2019-02-27 13:28:59,290 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 528 [2019-02-27 13:28:59,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:28:59,470 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 574 [2019-02-27 13:28:59,477 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:28:59,775 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:28:59,871 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:29:13,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:13,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:13,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:13,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:13,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:14,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:14,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:15,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:16,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:16,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:16,467 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:16,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:16,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:16,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,432 INFO L292 Elim1Store]: Index analysis took 3860 ms [2019-02-27 13:29:17,433 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 625 [2019-02-27 13:29:17,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:17,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 701 [2019-02-27 13:29:17,586 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:29:21,298 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:29:22,700 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:29:26,363 INFO L301 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-27 13:29:26,364 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:547, output treesize:435 [2019-02-27 13:29:28,385 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:29:28,385 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_34, v_subst_4, v_prenex_26, v_subst_5]. (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse7 (mod (+ .cse6 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse9 (mod (+ .cse8 1) 256))) (let ((.cse0 (select v_main_a_34 .cse9)) (.cse3 (mod (+ .cse9 1) 256)) (.cse1 (select v_main_a_34 .cse8)) (.cse2 (select v_main_a_34 .cse7)) (.cse4 (select v_main_a_34 (+ v_subst_4 (- 1))))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= main_y (mod (+ .cse3 1) 256)) (= .cse4 1000) (= (select v_main_a_34 v_subst_4) 0) (= .cse2 1000) (= main_a (let ((.cse5 (store v_main_a_34 main_x .cse0))) (store .cse5 main_y (select .cse5 .cse3)))) (= main_x .cse3) (= (select v_main_a_34 .cse3) .cse1) (= .cse2 (select v_main_a_34 .cse6)) (= .cse4 (select v_main_a_34 (mod v_subst_4 256))))))))) (let ((.cse20 (mod (+ v_subst_5 1) 256))) (let ((.cse18 (mod (+ .cse20 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse19 (mod (+ .cse17 1) 256))) (let ((.cse11 (select v_prenex_26 .cse20)) (.cse13 (mod (+ .cse19 1) 256)) (.cse15 (select v_prenex_26 .cse19)) (.cse12 (select v_prenex_26 .cse18)) (.cse14 (select v_prenex_26 .cse17)) (.cse10 (select v_prenex_26 v_subst_5))) (and (= .cse10 .cse11) (= 1000 .cse12) (= main_x .cse13) (= .cse14 (select v_prenex_26 .cse13)) (= .cse14 .cse15) (= .cse11 1000) (= main_y (mod (+ .cse13 1) 256)) (= (let ((.cse16 (store v_prenex_26 main_x .cse15))) (store .cse16 main_y (select .cse16 .cse13))) main_a) (= .cse12 .cse14) (= .cse10 (select v_prenex_26 (+ v_subst_5 (- 1)))) (= v_subst_5 (mod v_subst_5 256))))))))) [2019-02-27 13:29:28,385 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse0 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse9 (mod (+ .cse8 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a v_subst_5)) (.cse5 (mod (+ .cse10 1) 256)) (.cse1 (select main_a .cse10)) (.cse2 (select main_a .cse9)) (.cse6 (select main_a .cse8)) (.cse4 (select main_a .cse7))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 .cse4) (= main_x .cse5) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (select main_a main_y) .cse1) (= .cse2 .cse6) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 1000))))))) (let ((.cse11 (mod (+ v_subst_4 1) 256))) (let ((.cse20 (mod (+ .cse11 1) 256))) (let ((.cse19 (mod (+ .cse20 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse16 (mod (+ .cse18 1) 256))) (let ((.cse12 (select main_a .cse20)) (.cse15 (select main_a (+ v_subst_4 (- 1)))) (.cse17 (select main_a .cse19)) (.cse14 (select main_a .cse18)) (.cse13 (mod (+ .cse16 1) 256))) (and (= (select main_a .cse11) .cse12) (= 1000 .cse12) (= main_y .cse13) (= 0 (select main_a v_subst_4)) (= .cse14 .cse0) (= 1000 .cse15) (= (select main_a (mod v_subst_4 256)) .cse15) (= main_x .cse16) (= .cse17 .cse14) (= .cse17 1000) (= .cse14 (select main_a .cse13))))))))))) [2019-02-27 13:29:55,127 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 81 [2019-02-27 13:29:55,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:55,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:55,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:55,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:55,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:55,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:55,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:56,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:57,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:57,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:57,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:57,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:57,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:57,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:57,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:58,739 INFO L292 Elim1Store]: Index analysis took 3525 ms [2019-02-27 13:29:58,741 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 1126 [2019-02-27 13:29:59,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:29:59,072 INFO L292 Elim1Store]: Index analysis took 267 ms [2019-02-27 13:29:59,074 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 1222 [2019-02-27 13:29:59,109 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:30:08,657 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:30:11,647 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:30:48,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,078 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,391 INFO L292 Elim1Store]: Index analysis took 375 ms [2019-02-27 13:30:48,392 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 797 [2019-02-27 13:30:48,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:48,494 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 863 [2019-02-27 13:30:48,501 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:30:48,964 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:30:49,253 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:30:52,159 INFO L301 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-27 13:30:52,159 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:679, output treesize:525 [2019-02-27 13:30:54,182 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:30:54,182 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_subst_5, v_prenex_27, v_subst_4]. (or (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse12 1) 256))) (let ((.cse9 (mod (+ .cse8 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse3 (select v_main_a_35 .cse11)) (.cse0 (select v_main_a_35 .cse12)) (.cse2 (mod (+ .cse11 1) 256)) (.cse5 (select v_main_a_35 v_subst_5)) (.cse4 (select v_main_a_35 .cse10)) (.cse7 (select v_main_a_35 .cse9)) (.cse6 (select v_main_a_35 .cse8))) (and (= .cse0 1000) (= (let ((.cse1 (store v_main_a_35 main_x .cse3))) (store .cse1 main_y (select .cse1 .cse2))) main_a) (= .cse3 .cse4) (= (mod (+ .cse2 1) 256) main_y) (= (select v_main_a_35 .cse2) .cse4) (= .cse0 .cse5) (= main_x .cse2) (= .cse6 .cse7) (= .cse5 (select v_main_a_35 (+ v_subst_5 (- 1)))) (= .cse4 .cse7) (= 1000 .cse6) (= v_subst_5 (mod v_subst_5 256))))))))) (let ((.cse17 (mod (+ v_subst_4 1) 256))) (let ((.cse24 (mod (+ .cse17 1) 256))) (let ((.cse22 (mod (+ .cse24 1) 256))) (let ((.cse21 (mod (+ .cse22 1) 256))) (let ((.cse23 (mod (+ .cse21 1) 256))) (let ((.cse18 (select v_prenex_27 (+ v_subst_4 (- 1)))) (.cse15 (select v_prenex_27 .cse23)) (.cse16 (select v_prenex_27 .cse24)) (.cse14 (mod (+ .cse23 1) 256)) (.cse20 (select v_prenex_27 .cse22)) (.cse19 (select v_prenex_27 .cse21))) (and (= (let ((.cse13 (store v_prenex_27 main_x .cse15))) (store .cse13 main_y (select .cse13 .cse14))) main_a) (= .cse16 (select v_prenex_27 .cse17)) (= .cse18 (select v_prenex_27 (mod v_subst_4 256))) (= .cse18 1000) (= (select v_prenex_27 v_subst_4) 0) (= .cse15 .cse19) (= 1000 .cse20) (= main_x .cse14) (= .cse16 1000) (= main_y (mod (+ .cse14 1) 256)) (= (select v_prenex_27 .cse14) .cse19) (= .cse20 .cse19))))))))) [2019-02-27 13:30:54,182 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse6 (select main_a main_y))) (or (let ((.cse2 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse2 1) 256))) (let ((.cse7 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse7 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a .cse10)) (.cse4 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse8 1) 256)) (.cse5 (select main_a .cse9)) (.cse1 (select main_a .cse8))) (and (= (select main_a .cse0) .cse1) (= (select main_a .cse2) .cse3) (= 1000 .cse3) (= 0 (select main_a v_subst_4)) (= 1000 .cse4) (= main_x .cse0) (= .cse5 1000) (= (select main_a (mod v_subst_4 256)) .cse4) (= .cse6 .cse1) (= main_y (mod (+ .cse0 1) 256)) (= (select main_a .cse7) 1000) (= .cse5 .cse1)))))))) (let ((.cse18 (mod (+ v_subst_5 1) 256))) (let ((.cse21 (mod (+ .cse18 1) 256))) (let ((.cse17 (mod (+ .cse21 1) 256))) (let ((.cse19 (mod (+ .cse17 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse12 (select main_a v_subst_5)) (.cse14 (mod (+ .cse20 1) 256)) (.cse15 (select main_a .cse21)) (.cse16 (select main_a .cse20)) (.cse11 (select main_a .cse19)) (.cse13 (select main_a .cse18))) (and (= 1000 .cse11) (= .cse12 .cse13) (= .cse12 (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse14 1) 256) main_y) (= .cse15 1000) (= main_x .cse14) (= .cse16 (select main_a main_x)) (= (select main_a .cse17) .cse15) (= .cse16 .cse6) (= .cse16 .cse11) (= v_subst_5 (mod v_subst_5 256)) (= .cse13 1000)))))))))) [2019-02-27 13:30:56,224 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_subst_5 Int)) (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse10 (mod (+ .cse7 1) 256))) (let ((.cse6 (mod (+ .cse10 1) 256))) (let ((.cse8 (mod (+ .cse6 1) 256))) (let ((.cse9 (mod (+ .cse8 1) 256))) (let ((.cse1 (select c_main_a v_subst_5)) (.cse3 (mod (+ .cse9 1) 256)) (.cse4 (select c_main_a .cse10)) (.cse5 (select c_main_a .cse9)) (.cse0 (select c_main_a .cse8)) (.cse2 (select c_main_a .cse7))) (and (= 1000 .cse0) (= .cse1 .cse2) (= .cse1 (select c_main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse3 1) 256) c_main_y) (= .cse4 1000) (= c_main_x .cse3) (= .cse5 (select c_main_a c_main_x)) (= (select c_main_a .cse6) .cse4) (= .cse5 (select c_main_a c_main_y)) (= .cse5 .cse0) (= v_subst_5 (mod v_subst_5 256)) (= .cse2 1000))))))))) (exists ((v_subst_4 Int)) (let ((.cse13 (mod (+ v_subst_4 1) 256))) (let ((.cse20 (mod (+ .cse13 1) 256))) (let ((.cse17 (mod (+ .cse20 1) 256))) (let ((.cse19 (mod (+ .cse17 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse14 (select c_main_a .cse20)) (.cse15 (select c_main_a (+ v_subst_4 (- 1)))) (.cse11 (mod (+ .cse18 1) 256)) (.cse16 (select c_main_a .cse19)) (.cse12 (select c_main_a .cse18))) (and (= (select c_main_a .cse11) .cse12) (= (select c_main_a .cse13) .cse14) (= 1000 .cse14) (= 0 (select c_main_a v_subst_4)) (= 1000 .cse15) (= c_main_x .cse11) (= .cse16 1000) (= (select c_main_a c_main_y) .cse12) (= (select c_main_a (mod v_subst_4 256)) .cse15) (= c_main_y (mod (+ .cse11 1) 256)) (= (select c_main_a .cse17) 1000) (= .cse16 .cse12)))))))))) is different from false [2019-02-27 13:30:56,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:56,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,180 INFO L292 Elim1Store]: Index analysis took 868 ms [2019-02-27 13:30:57,182 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 1136 [2019-02-27 13:30:57,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:30:57,404 INFO L292 Elim1Store]: Index analysis took 132 ms [2019-02-27 13:30:57,405 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 1226 [2019-02-27 13:30:57,413 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 13:30:58,614 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:30:59,111 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:31:40,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:41,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:41,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:41,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:41,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:42,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:42,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:42,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:42,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:42,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:42,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:43,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:43,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:43,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:44,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:44,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:44,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:44,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:45,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:45,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:45,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:45,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:45,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:46,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:46,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:46,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:47,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:47,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:47,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:47,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:47,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:48,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:48,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:48,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:49,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:50,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:50,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:50,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:50,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:50,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:51,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:51,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:51,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:51,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:51,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:51,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:51,885 INFO L292 Elim1Store]: Index analysis took 11413 ms [2019-02-27 13:31:51,886 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 1279 [2019-02-27 13:31:52,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:31:52,204 INFO L292 Elim1Store]: Index analysis took 246 ms [2019-02-27 13:31:52,206 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 57 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 1375 [2019-02-27 13:31:52,215 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-27 13:32:01,698 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:32:05,618 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:32:14,577 INFO L301 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-27 13:32:14,577 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:809, output treesize:621 [2019-02-27 13:32:16,590 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:32:16,590 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_28, v_subst_5, v_main_a_36, v_subst_4]. (or (let ((.cse13 (mod (+ v_subst_5 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse4 (mod (+ .cse12 1) 256))) (let ((.cse10 (mod (+ .cse4 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse11 1) 256))) (let ((.cse3 (select v_prenex_28 v_subst_5)) (.cse2 (select v_prenex_28 .cse13)) (.cse5 (select v_prenex_28 .cse12)) (.cse0 (select v_prenex_28 .cse11)) (.cse6 (select v_prenex_28 .cse10)) (.cse1 (mod (+ .cse9 1) 256)) (.cse7 (select v_prenex_28 .cse9))) (and (= .cse0 (select v_prenex_28 .cse1)) (= .cse1 main_x) (= 1000 .cse2) (= (select v_prenex_28 (+ v_subst_5 (- 1))) .cse3) (= (select v_prenex_28 .cse4) .cse5) (= main_y (mod (+ .cse1 1) 256)) (= .cse3 .cse2) (= 1000 .cse6) (= .cse0 .cse7) (= 1000 .cse5) (= .cse0 .cse6) (= (let ((.cse8 (store v_prenex_28 main_x .cse7))) (store .cse8 main_y (select .cse8 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)))))))))) (let ((.cse18 (mod (+ v_subst_4 1) 256))) (let ((.cse25 (mod (+ .cse18 1) 256))) (let ((.cse21 (mod (+ .cse25 1) 256))) (let ((.cse26 (mod (+ .cse21 1) 256))) (let ((.cse23 (mod (+ .cse26 1) 256))) (let ((.cse24 (mod (+ .cse23 1) 256))) (let ((.cse14 (select v_main_a_36 .cse26)) (.cse19 (select v_main_a_36 .cse24)) (.cse17 (select v_main_a_36 .cse25)) (.cse20 (select v_main_a_36 (+ v_subst_4 (- 1)))) (.cse16 (mod (+ .cse24 1) 256)) (.cse15 (select v_main_a_36 .cse23))) (and (= .cse14 .cse15) (= main_y (mod (+ .cse16 1) 256)) (= .cse17 (select v_main_a_36 .cse18)) (= .cse15 .cse19) (= main_x .cse16) (= .cse14 1000) (= .cse20 (select v_main_a_36 (mod v_subst_4 256))) (= (select v_main_a_36 .cse21) 1000) (= 0 (select v_main_a_36 v_subst_4)) (= (let ((.cse22 (store v_main_a_36 main_x .cse19))) (store .cse22 main_y (select .cse22 .cse16))) main_a) (= 1000 .cse17) (= .cse20 1000) (= (select v_main_a_36 .cse16) .cse15)))))))))) [2019-02-27 13:32:16,591 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse2 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse6 1) 256))) (let ((.cse9 (mod (+ .cse10 1) 256))) (let ((.cse5 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse12 (mod (+ .cse11 1) 256))) (let ((.cse0 (mod (+ .cse12 1) 256)) (.cse3 (select main_a .cse12)) (.cse1 (select main_a .cse11)) (.cse7 (select main_a .cse10)) (.cse8 (select main_a (+ v_subst_4 (- 1))))) (and (= main_y (mod (+ .cse0 1) 256)) (= main_x .cse0) (= 1000 .cse1) (= .cse2 .cse3) (= .cse4 .cse3) (= (select main_a .cse5) .cse1) (= .cse3 .cse1) (= (select main_a .cse6) .cse7) (= 1000 .cse7) (= 0 (select main_a v_subst_4)) (= 1000 .cse8) (= (select main_a (mod v_subst_4 256)) .cse8) (= (select main_a .cse9) 1000))))))))) (let ((.cse21 (mod (+ v_subst_5 1) 256))) (let ((.cse22 (mod (+ .cse21 1) 256))) (let ((.cse20 (mod (+ .cse22 1) 256))) (let ((.cse13 (mod (+ .cse20 1) 256))) (let ((.cse24 (mod (+ .cse13 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse15 (mod (+ .cse23 1) 256)) (.cse17 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse16 (select main_a v_subst_5)) (.cse19 (select main_a .cse22)) (.cse18 (select main_a .cse21))) (and (= 1000 (select main_a .cse13)) (= .cse2 .cse14) (= .cse4 .cse14) (= .cse15 main_x) (= .cse16 (select main_a (+ v_subst_5 (- 1)))) (= .cse17 1000) (= main_y (mod (+ .cse15 1) 256)) (= .cse17 .cse14) (= .cse16 .cse18) (= .cse19 1000) (= (select main_a .cse20) .cse19) (= v_subst_5 (mod v_subst_5 256)) (= .cse18 1000))))))))))) [2019-02-27 13:32:50,534 WARN L181 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 96 [2019-02-27 13:32:50,688 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {323#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-02-27 13:32:50,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#(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]]; {327#(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 VALID [2019-02-27 13:32:52,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#(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]]; {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (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-27 13:32:54,861 INFO L273 TraceCheckUtils]: 3: Hoare triple {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (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]]; {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (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)))) (= (select main_a v_subst_5) 1000) (= 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)))))} is UNKNOWN [2019-02-27 13:32:56,873 INFO L273 TraceCheckUtils]: 4: Hoare triple {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (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)))) (= (select main_a v_subst_5) 1000) (= 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)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {339#(or (exists ((v_subst_5 Int)) (and (= (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)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (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)))))} is UNKNOWN [2019-02-27 13:32:58,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#(or (exists ((v_subst_5 Int)) (and (= (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)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (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)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 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 (+ v_subst_5 1) 256) 1) 256)) 1000) (= (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)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} is UNKNOWN [2019-02-27 13:33:00,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 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 (+ v_subst_5 1) 256) 1) 256)) 1000) (= (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)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {347#(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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (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 main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 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 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (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))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (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))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-02-27 13:33:02,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {347#(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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (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 main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 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 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (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))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (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))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {351#(or (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (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)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (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 (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) 1000) (= (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 (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))))} is UNKNOWN [2019-02-27 13:33:04,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(or (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (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)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (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 (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) 1000) (= (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 (+ (mod (+ v_subst_4 1) 256) 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]]; {355#(or (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 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 (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= (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))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) 1000))))} is UNKNOWN [2019-02-27 13:33:04,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#(or (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 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 (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= (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))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) 1000))))} assume a[x] == 0; {314#false} is VALID [2019-02-27 13:33:04,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-02-27 13:33:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 17 refuted. 11 times theorem prover too weak. 0 trivial. 8 not checked. [2019-02-27 13:33:04,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 13:33:24,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {314#false} is VALID [2019-02-27 13:33:24,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {362#(= (select main_a main_y) 1000)} is VALID [2019-02-27 13:33:24,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(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]]; {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-02-27 13:33:24,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(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]]; {370#(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-27 13:33:24,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(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]]; {374#(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-27 13:33:25,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(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]]; {374#(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-27 13:33:25,682 INFO L273 TraceCheckUtils]: 4: Hoare triple {374#(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]]; {374#(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-27 13:33:25,818 INFO L273 TraceCheckUtils]: 3: Hoare triple {374#(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]]; {374#(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-27 13:33:25,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#(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]]; {374#(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-27 13:33:26,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#(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]]; {374#(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-27 13:33:26,058 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {374#(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-27 13:33:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-27 13:33:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 13:33:26,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 4] total 19 [2019-02-27 13:33:26,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 13:33:26,078 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-02-27 13:33:26,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:33:26,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-02-27 13:33:40,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 12 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2019-02-27 13:33:40,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-27 13:33:40,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-27 13:33:40,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=199, Unknown=32, NotChecked=34, Total=380 [2019-02-27 13:33:40,933 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-02-27 13:37:04,637 WARN L181 SmtUtils]: Spent 9.23 s on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-02-27 13:37:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:37:14,775 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-02-27 13:37:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-27 13:37:14,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-02-27 13:37:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:37:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-27 13:37:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-27 13:37:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-27 13:37:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-27 13:37:14,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 14 transitions. [2019-02-27 13:37:30,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 6 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2019-02-27 13:37:30,910 INFO L225 Difference]: With dead ends: 13 [2019-02-27 13:37:30,910 INFO L226 Difference]: Without dead ends: 0 [2019-02-27 13:37:30,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 132.1s TimeCoverageRelationStatistics Valid=125, Invalid=214, Unknown=45, NotChecked=36, Total=420 [2019-02-27 13:37:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-27 13:37:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-27 13:37:30,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:37:30,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-27 13:37:30,911 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 13:37:30,911 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 13:37:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:37:30,911 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 13:37:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 13:37:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:37:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:37:30,911 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 13:37:30,912 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 13:37:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:37:30,912 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 13:37:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 13:37:30,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:37:30,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:37:30,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:37:30,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:37:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-27 13:37:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-27 13:37:30,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-02-27 13:37:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:37:30,913 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-27 13:37:30,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-27 13:37:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 13:37:30,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:37:30,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-27 13:37:45,160 WARN L181 SmtUtils]: Spent 14.17 s on a formula simplification. DAG size of input: 375 DAG size of output: 35 [2019-02-27 13:37:45,168 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 9 30) no Hoare annotation was computed. [2019-02-27 13:37:45,168 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-02-27 13:37:45,168 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 9 30) no Hoare annotation was computed. [2019-02-27 13:37:45,169 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 30) no Hoare annotation was computed. [2019-02-27 13:37:45,169 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 28) no Hoare annotation was computed. [2019-02-27 13:37:45,169 INFO L444 ceAbstractionStarter]: At program point L18-1(lines 18 29) the Hoare annotation is: (let ((.cse0 (select main_a main_x)) (.cse1 (select main_a main_y))) (or (and (= .cse0 1000) (= .cse1 0) (= main_y (+ main_x 1))) (and (= .cse0 .cse1) (not (= 0 .cse1))) (exists ((main_yold Int)) (let ((.cse2 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse2) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) .cse2) (= (select main_a main_x) .cse3) (= 1000 .cse3)))))) [2019-02-27 13:37:45,171 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-02-27 13:37:47,179 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-02-27 13:37:47,179 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-02-27 13:37:47,179 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-02-27 13:37:47,179 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-02-27 13:37:47,179 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-02-27 13:37:47,180 INFO L163 areAnnotationChecker]: CFG has 1 edges. 0 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-27 13:37:47,187 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.02 01:37:47 BoogieIcfgContainer [2019-02-27 13:37:47,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-27 13:37:47,188 INFO L168 Benchmark]: Toolchain (without parser) took 725274.16 ms. Allocated memory was 134.7 MB in the beginning and 265.3 MB in the end (delta: 130.5 MB). Free memory was 110.0 MB in the beginning and 219.5 MB in the end (delta: -109.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-02-27 13:37:47,189 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 13:37:47,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.32 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 107.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-27 13:37:47,190 INFO L168 Benchmark]: Boogie Preprocessor took 23.65 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-27 13:37:47,190 INFO L168 Benchmark]: RCFGBuilder took 249.40 ms. Allocated memory is still 134.7 MB. Free memory was 106.8 MB in the beginning and 96.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-02-27 13:37:47,190 INFO L168 Benchmark]: TraceAbstraction took 724961.65 ms. Allocated memory was 134.7 MB in the beginning and 265.3 MB in the end (delta: 130.5 MB). Free memory was 96.6 MB in the beginning and 219.5 MB in the end (delta: -122.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-02-27 13:37:47,192 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.32 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 107.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.65 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 249.40 ms. Allocated memory is still 134.7 MB. Free memory was 106.8 MB in the beginning and 96.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 724961.65 ms. Allocated memory was 134.7 MB in the beginning and 265.3 MB in the end (delta: 130.5 MB). Free memory was 96.6 MB in the beginning and 219.5 MB in the end (delta: -122.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((a[x] == 1000 && a[y] == 0) && y == x + 1) || (a[x] == a[y] && !(0 == a[y]))) || (exists main_yold : int :: ((((main_yold % 256 == x && 0 == a[main_yold]) && y == (main_yold + 1) % 256) && a[y] == a[main_yold]) && a[x] == a[main_yold + -1]) && 1000 == a[main_yold + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 722.8s OverallTime, 5 OverallIterations, 8 TraceHistogramMax, 298.2s AutomataDifference, 0.0s DeadEndRemovalTime, 14.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 76 SolverSat, 9 SolverUnsat, 52 SolverUnknown, 0 SolverNotchecked, 107.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 142.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 73 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 3367 FormulaSimplificationTreeSizeReductionInter, 14.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 374.7s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 18 QuantifiedInterpolants, 57252 SizeOfPredicates, 38 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 32/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...