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-b7bd044-m [2019-01-18 14:48:18,638 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 14:48:18,640 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 14:48:18,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 14:48:18,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 14:48:18,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 14:48:18,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 14:48:18,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 14:48:18,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 14:48:18,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 14:48:18,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 14:48:18,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 14:48:18,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 14:48:18,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 14:48:18,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 14:48:18,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 14:48:18,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 14:48:18,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 14:48:18,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 14:48:18,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 14:48:18,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 14:48:18,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 14:48:18,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 14:48:18,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 14:48:18,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 14:48:18,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 14:48:18,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 14:48:18,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 14:48:18,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 14:48:18,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 14:48:18,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 14:48:18,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 14:48:18,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 14:48:18,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 14:48:18,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 14:48:18,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 14:48:18,686 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-01-18 14:48:18,699 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 14:48:18,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 14:48:18,700 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 14:48:18,701 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 14:48:18,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 14:48:18,701 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 14:48:18,701 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 14:48:18,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 14:48:18,702 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 14:48:18,702 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 14:48:18,702 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 14:48:18,702 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 14:48:18,703 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 14:48:18,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 14:48:18,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 14:48:18,704 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 14:48:18,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 14:48:18,704 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 14:48:18,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 14:48:18,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 14:48:18,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 14:48:18,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 14:48:18,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 14:48:18,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 14:48:18,705 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 14:48:18,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 14:48:18,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 14:48:18,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 14:48:18,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 14:48:18,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 14:48:18,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:48:18,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 14:48:18,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 14:48:18,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 14:48:18,707 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 14:48:18,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 14:48:18,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 14:48:18,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 14:48:18,708 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 14:48:18,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 14:48:18,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 14:48:18,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 14:48:18,754 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 14:48:18,754 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 14:48:18,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2019-01-18 14:48:18,755 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-01-18 14:48:18,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 14:48:18,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 14:48:18,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 14:48:18,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 14:48:18,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 14:48:18,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,826 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-18 14:48:18,827 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-18 14:48:18,827 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-18 14:48:18,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 14:48:18,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 14:48:18,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 14:48:18,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 14:48:18,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... [2019-01-18 14:48:18,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 14:48:18,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 14:48:18,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 14:48:18,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 14:48:18,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:48:18,918 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-18 14:48:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-18 14:48:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-18 14:48:19,133 INFO L278 CfgBuilder]: Using library mode [2019-01-18 14:48:19,134 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-18 14:48:19,135 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:48:19 BoogieIcfgContainer [2019-01-18 14:48:19,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 14:48:19,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 14:48:19,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 14:48:19,139 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 14:48:19,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:48:18" (1/2) ... [2019-01-18 14:48:19,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15452efe and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:48:19, skipping insertion in model container [2019-01-18 14:48:19,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:48:19" (2/2) ... [2019-01-18 14:48:19,143 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-01-18 14:48:19,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 14:48:19,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 14:48:19,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 14:48:19,203 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 14:48:19,203 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 14:48:19,203 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 14:48:19,203 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 14:48:19,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 14:48:19,204 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 14:48:19,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 14:48:19,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 14:48:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 14:48:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:48:19,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:48:19,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:48:19,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:48:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:48:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-01-18 14:48:19,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:48:19,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:48:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:48:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:48:19,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:48:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:48:19,732 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-01-18 14:48:19,737 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-01-18 14:48:19,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-01-18 14:48:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:48:19,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:48:19,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 14:48:19,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:48:19,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 14:48:19,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:48:19,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-18 14:48:19,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:48:19,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 14:48:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 14:48:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 14:48:19,803 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-18 14:48:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:48:20,049 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-18 14:48:20,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 14:48:20,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 14:48:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:48:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:48:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-18 14:48:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:48:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-18 14:48:20,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-01-18 14:48:20,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:48:20,228 INFO L225 Difference]: With dead ends: 15 [2019-01-18 14:48:20,239 INFO L226 Difference]: Without dead ends: 5 [2019-01-18 14:48:20,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 14:48:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-18 14:48:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-18 14:48:20,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:48:20,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-18 14:48:20,326 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-18 14:48:20,327 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-18 14:48:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:48:20,328 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-18 14:48:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:48:20,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:48:20,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:48:20,329 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-18 14:48:20,330 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-18 14:48:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:48:20,331 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-18 14:48:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:48:20,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:48:20,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:48:20,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:48:20,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:48:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-18 14:48:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-18 14:48:20,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-18 14:48:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:48:20,335 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-18 14:48:20,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 14:48:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:48:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:48:20,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:48:20,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:48:20,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:48:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:48:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-01-18 14:48:20,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:48:20,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:48:20,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:48:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:48:20,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:48:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:48:20,752 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-18 14:48:20,776 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-01-18 14:48:20,779 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-01-18 14:48:20,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-01-18 14:48:20,781 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-18 14:48:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:48:20,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:48:20,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:48:20,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:48:20,785 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-01-18 14:48:20,838 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 14:48:20,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:48:25,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:48:25,171 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-01-18 14:48:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:48:25,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:48:25,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:48:25,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:48:25,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:48:25,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:48:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:48:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:48:25,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:48:25,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:48:25,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:48:25,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:25,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:25,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:25,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:48:25,432 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:48:25,432 WARN L385 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-01-18 14:48:25,433 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:48:25,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2019-01-18 14:48:25,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 70 [2019-01-18 14:48:25,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:25,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:25,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 90 [2019-01-18 14:48:25,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:26,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:48:26,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 57 [2019-01-18 14:48:26,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2019-01-18 14:48:26,075 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:26,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:26,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 86 [2019-01-18 14:48:26,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:26,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:48:26,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-18 14:48:26,426 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2019-01-18 14:48:28,626 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:48:28,626 WARN L385 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-01-18 14:48:28,627 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4, v_prenex_3]. (let ((.cse6 (select main_a main_x)) (.cse1 (select main_a (+ main_x (- 1))))) (let ((.cse2 (= main_x (mod main_x 256))) (.cse3 (= 1000 .cse1)) (.cse0 (select main_a (mod (+ main_x 1) 256))) (.cse4 (= .cse6 .cse1))) (or (and (= .cse0 .cse1) .cse2 .cse3 .cse4) (let ((.cse5 (select main_a v_prenex_4)) (.cse7 (+ v_prenex_4 1))) (and (= (select main_a (mod (+ v_prenex_4 2) 256)) .cse5) (= .cse6 .cse5) (= .cse5 1000) (= 0 (select main_a .cse7)) (= main_x (mod .cse7 256)))) (and .cse2 .cse3 (= .cse0 (select main_a v_prenex_3)) .cse4) (let ((.cse8 (select main_a main_xold)) (.cse9 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse6 .cse8) (= 0 (select main_a .cse9)) (= .cse8 1000) (= main_x (mod .cse9 256))))))) [2019-01-18 14:48:28,810 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-01-18 14:48:28,928 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-01-18 14:48:30,943 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-01-18 14:48:30,954 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-01-18 14:48:30,955 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-18 14:48:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:48:30,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:48:31,071 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-18 14:48:31,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-01-18 14:48:31,074 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-01-18 14:48:31,075 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-01-18 14:48:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:48:31,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:48:31,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-18 14:48:31,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:48:31,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:48:31,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:48:31,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-18 14:48:33,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-18 14:48:33,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 14:48:33,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 14:48:33,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:48:33,154 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-18 14:48:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:48:37,318 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 14:48:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 14:48:37,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:48:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:48:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:48:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-18 14:48:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:48:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-18 14:48:37,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-01-18 14:48:39,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-18 14:48:39,358 INFO L225 Difference]: With dead ends: 8 [2019-01-18 14:48:39,358 INFO L226 Difference]: Without dead ends: 6 [2019-01-18 14:48:39,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:48:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-18 14:48:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-18 14:48:39,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:48:39,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-18 14:48:39,371 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-18 14:48:39,371 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-18 14:48:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:48:39,372 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-18 14:48:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 14:48:39,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:48:39,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:48:39,373 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-18 14:48:39,373 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-18 14:48:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:48:39,374 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-18 14:48:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 14:48:39,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:48:39,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:48:39,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:48:39,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:48:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:48:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-18 14:48:39,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-18 14:48:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:48:39,377 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-18 14:48:39,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 14:48:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 14:48:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 14:48:39,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:48:39,378 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 14:48:39,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:48:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:48:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-01-18 14:48:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:48:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:48:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:48:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:48:39,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:48:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:48:39,693 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2019-01-18 14:48:39,771 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-01-18 14:48:39,775 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-01-18 14:48:39,777 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-01-18 14:48:39,778 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2019-01-18 14:48:39,779 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-18 14:48:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:48:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:48:39,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:48:39,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 14:48:39,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 14:48:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:48:39,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:48:39,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 14:48:39,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 14:48:39,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 14:48:39,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 14:48:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:48:39,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:48:39,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:48:39,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:39,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:39,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:48:39,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:39,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:39,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:39,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:48:39,883 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:48:39,883 WARN L385 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-01-18 14:48:39,883 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:48:40,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 53 [2019-01-18 14:48:40,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 66 [2019-01-18 14:48:40,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:40,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-18 14:48:40,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:40,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:48:40,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 54 [2019-01-18 14:48:40,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2019-01-18 14:48:40,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:40,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:40,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 46 [2019-01-18 14:48:40,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:40,648 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:48:40,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-18 14:48:40,737 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-01-18 14:48:42,931 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:48:42,931 WARN L385 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-01-18 14:48:42,931 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_8, v_prenex_7]. (let ((.cse0 (select main_a main_x)) (.cse10 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse3 (select main_a main_y)) (.cse7 (= main_x (mod main_x 256))) (.cse8 (= 1000 .cse10)) (.cse9 (= .cse0 .cse10))) (or (let ((.cse1 (select main_a v_prenex_8)) (.cse2 (+ v_prenex_8 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_8 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= .cse4 1000) (= 0 (select main_a .cse5)) (= main_x (mod .cse5 256)) (= .cse3 (select main_a main_yold)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 .cse7 (= .cse3 (select main_a v_prenex_7)) .cse8 .cse9) (and .cse6 (= .cse3 .cse10) .cse7 .cse8 .cse9)))) [2019-01-18 14:48:43,240 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-18 14:48:43,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 72 [2019-01-18 14:48:43,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 100 [2019-01-18 14:48:43,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:43,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:43,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2019-01-18 14:48:43,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:43,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 93 [2019-01-18 14:48:43,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:43,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:44,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 122 [2019-01-18 14:48:44,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 167 [2019-01-18 14:48:44,852 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:44,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:44,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 125 [2019-01-18 14:48:44,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:44,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:45,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:48:45,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 164 [2019-01-18 14:48:45,030 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 14:48:45,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:48:45,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-18 14:48:45,262 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2019-01-18 14:48:47,483 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:48:47,483 WARN L385 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-01-18 14:48:47,483 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1, main_yold, v_prenex_11, main_xold, v_prenex_10]. (let ((.cse4 (select main_a main_x))) (or (let ((.cse3 (+ v_subst_1 1))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (select main_a v_subst_1)) (.cse2 (select main_a .cse0))) (and (= main_x (mod (+ .cse0 1) 256)) (= .cse1 .cse2) (= (select main_a .cse3) 0) (= .cse1 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= .cse4 .cse2))))) (let ((.cse8 (+ v_prenex_11 1))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (select main_a v_prenex_11)) (.cse5 (select main_a .cse6))) (and (= .cse5 (select main_a (mod (+ (mod (+ v_prenex_11 2) 256) 1) 256))) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse5) (= .cse7 1000) (= (select main_a .cse8) 0) (= .cse4 .cse5))))) (let ((.cse9 (select main_a main_xold)) (.cse11 (mod (+ main_xold 1) 256)) (.cse10 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse9 .cse10) (= .cse4 .cse9) (= main_x .cse11) (= (select main_a (mod (+ .cse11 1) 256)) (select main_a v_prenex_10)) (= 1000 .cse10))))) [2019-01-18 14:48:47,967 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-18 14:48:48,071 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-01-18 14:48:49,540 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 VALID [2019-01-18 14:48:51,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} is UNKNOWN [2019-01-18 14:48:51,625 INFO L273 TraceCheckUtils]: 3: Hoare triple {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} assume a[x] == 0; {110#false} is VALID [2019-01-18 14:48:51,625 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-18 14:48:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:48:51,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:48:55,414 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-18 14:48:55,415 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2019-01-18 14:48:55,417 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-01-18 14:48:55,421 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-01-18 14:48:55,423 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-01-18 14:48:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 14:48:55,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:48:55,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-18 14:48:55,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:48:55,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:48:55,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:48:55,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-18 14:48:59,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-18 14:48:59,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 14:48:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 14:48:59,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 14:48:59,529 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-01-18 14:49:09,600 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-01-18 14:49:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:49:13,778 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-18 14:49:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 14:49:13,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:49:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:49:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:49:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-18 14:49:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:49:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-18 14:49:13,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-01-18 14:49:17,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-18 14:49:17,880 INFO L225 Difference]: With dead ends: 10 [2019-01-18 14:49:17,880 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 14:49:17,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 14:49:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 14:49:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-18 14:49:17,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:49:17,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-18 14:49:17,906 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-18 14:49:17,906 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-18 14:49:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:49:17,907 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 14:49:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 14:49:17,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:49:17,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:49:17,908 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-18 14:49:17,908 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-18 14:49:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:49:17,909 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 14:49:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 14:49:17,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:49:17,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:49:17,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:49:17,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:49:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:49:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-18 14:49:17,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-18 14:49:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:49:17,910 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-18 14:49:17,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 14:49:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 14:49:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 14:49:17,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:49:17,911 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-18 14:49:17,911 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:49:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:49:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-01-18 14:49:17,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:49:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:49:17,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 14:49:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:49:17,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:49:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:49:18,510 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-01-18 14:49:18,610 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-01-18 14:49:18,618 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-01-18 14:49:18,622 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-01-18 14:49:18,624 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-01-18 14:49:18,625 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-01-18 14:49:18,626 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-01-18 14:49:18,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-18 14:49:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:49:18,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:49:18,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:49:18,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 14:49:18,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 14:49:18,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:49:18,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:49:18,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 14:49:18,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 14:49:18,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 14:49:18,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 14:49:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:49:18,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:49:18,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:49:18,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:18,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:18,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:49:18,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:18,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:18,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:18,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:49:18,844 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:49:18,844 WARN L385 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-01-18 14:49:18,844 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:49:19,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2019-01-18 14:49:19,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-18 14:49:19,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:19,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:19,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-18 14:49:19,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:19,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-18 14:49:19,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:19,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:19,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 14:49:19,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-18 14:49:21,381 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:49:21,381 WARN L385 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-01-18 14:49:21,381 WARN L386 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-01-18 14:49:21,797 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-18 14:49:21,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:21,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:21,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:21,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-18 14:49:21,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:21,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:21,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:21,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:21,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-18 14:49:21,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:21,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:22,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,036 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:49:22,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 148 [2019-01-18 14:49:22,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:22,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 136 [2019-01-18 14:49:22,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:22,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:22,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:49:22,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-18 14:49:24,297 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:49:24,297 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_21, v_subst_2, v_prenex_12, main_xold]. (or (let ((.cse5 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_21 v_subst_2)) (.cse4 (select v_main_a_21 (+ v_subst_2 (- 1)))) (.cse3 (select v_main_a_21 .cse5)) (.cse1 (mod (+ v_subst_2 1) 256))) (and (= 0 .cse0) (= (select v_main_a_21 .cse1) .cse0) (= main_a (let ((.cse2 (store v_main_a_21 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1)))) (= 1000 .cse4) (= .cse4 .cse3) (= main_x (mod (+ .cse5 1) 256)) (= (mod (+ .cse1 1) 256) main_y)))) (let ((.cse8 (select v_prenex_12 main_xold)) (.cse9 (select v_prenex_12 (+ main_xold (- 1)))) (.cse7 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= (let ((.cse6 (store v_prenex_12 main_x .cse8))) (store .cse6 main_y (select .cse6 .cse7))) main_a) (= .cse8 .cse9) (= .cse9 1000) (= main_x .cse7) (= .cse9 (select v_prenex_12 .cse7)) (= main_y (mod (+ .cse7 1) 256))))) [2019-01-18 14:49:24,298 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, main_xold]. (or (let ((.cse3 (mod v_subst_2 256))) (let ((.cse2 (mod (+ v_subst_2 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a .cse3))) (and (= .cse0 1000) (= (select main_a main_y) .cse1) (= 0 (select main_a v_subst_2)) (= (mod (+ .cse2 1) 256) main_y) (= main_x .cse2) (= .cse0 .cse1) (= (select main_a (mod (+ .cse3 1) 256)) .cse1)))) (let ((.cse6 (mod (+ main_xold 1) 256))) (let ((.cse5 (select main_a (+ main_xold (- 1)))) (.cse4 (select main_a main_xold)) (.cse7 (mod (+ .cse6 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse4 .cse5) (= (select main_a main_x) .cse4) (= main_x .cse6) (= main_y .cse7) (= 1000 .cse5) (= .cse4 (select main_a .cse7)))))) [2019-01-18 14:49:24,997 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-18 14:49:25,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 161 [2019-01-18 14:49:25,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 159 [2019-01-18 14:49:25,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:25,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:25,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:49:25,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 270 [2019-01-18 14:49:25,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:25,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 192 [2019-01-18 14:49:25,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:25,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:26,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:49:26,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2019-01-18 14:49:28,121 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:49:28,121 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_22, v_subst_2, v_prenex_13, v_subst_3]. (or (let ((.cse4 (mod v_subst_2 256)) (.cse2 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (mod (+ .cse2 1) 256)) (.cse3 (select v_main_a_22 (+ v_subst_2 (- 1)))) (.cse5 (select v_main_a_22 .cse4))) (and (= (let ((.cse0 (store v_main_a_22 main_x (select v_main_a_22 .cse2)))) (store .cse0 main_y (select .cse0 .cse1))) main_a) (= (select v_main_a_22 v_subst_2) 0) (= 1000 .cse3) (= (mod (+ .cse1 1) 256) main_y) (= (select v_main_a_22 (mod (+ .cse4 1) 256)) .cse5) (= .cse1 main_x) (= (select v_main_a_22 .cse1) .cse5) (= .cse3 .cse5)))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse7 (select v_prenex_13 (+ v_subst_3 (- 1)))) (.cse9 (select v_prenex_13 .cse11)) (.cse10 (select v_prenex_13 v_subst_3)) (.cse6 (mod (+ .cse11 1) 256))) (and (= .cse6 main_x) (= .cse7 1000) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse8 (store v_prenex_13 main_x .cse9))) (store .cse8 main_y (select .cse8 .cse6))) main_a) (= .cse7 .cse10) (= .cse10 .cse9) (= (select v_prenex_13 .cse6) .cse10) (= main_y (mod (+ .cse6 1) 256)))))) [2019-01-18 14:49:28,122 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_3, v_subst_2]. (let ((.cse3 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_3 1) 256))) (let ((.cse0 (mod (+ .cse4 1) 256)) (.cse2 (select main_a .cse4)) (.cse1 (select main_a v_subst_3))) (and (= .cse0 main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= .cse1 .cse2) (= main_y (mod (+ .cse0 1) 256)) (= .cse3 .cse2) (= (select main_a .cse0) .cse2) (= .cse1 1000)))) (let ((.cse9 (mod v_subst_2 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse5 (select main_a (+ v_subst_2 (- 1)))) (.cse7 (select main_a (mod (+ .cse9 1) 256))) (.cse8 (select main_a .cse9))) (and (= .cse5 1000) (= (mod (+ .cse6 1) 256) main_y) (= .cse7 .cse3) (= .cse6 main_x) (= .cse7 (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= .cse5 .cse8) (= .cse7 .cse8)))))) [2019-01-18 14:49:28,930 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-18 14:49:32,871 WARN L181 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-01-18 14:49:32,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 296 [2019-01-18 14:49:32,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:32,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 212 [2019-01-18 14:49:32,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:33,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:34,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,752 INFO L303 Elim1Store]: Index analysis took 597 ms [2019-01-18 14:49:34,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 394 [2019-01-18 14:49:34,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:49:34,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 319 [2019-01-18 14:49:34,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:49:35,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:49:35,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:49:35,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2019-01-18 14:49:37,692 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:49:37,692 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_23, v_subst_2, v_prenex_14, v_subst_3]. (or (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse7 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_23 .cse7)) (.cse2 (select v_main_a_23 (mod (+ .cse7 1) 256))) (.cse3 (mod (+ .cse6 1) 256)) (.cse4 (select v_main_a_23 .cse6)) (.cse1 (select v_main_a_23 (+ v_subst_2 (- 1))))) (and (= .cse0 .cse1) (= .cse2 (select v_main_a_23 .cse3)) (= .cse4 .cse2) (= 0 (select v_main_a_23 v_subst_2)) (= .cse0 .cse2) (= .cse3 main_x) (= main_y (mod (+ .cse3 1) 256)) (= (let ((.cse5 (store v_main_a_23 main_x .cse4))) (store .cse5 main_y (select .cse5 .cse3))) main_a) (= .cse1 1000)))) (let ((.cse14 (mod (+ v_subst_3 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse10 (select v_prenex_14 v_subst_3)) (.cse8 (mod (+ .cse13 1) 256)) (.cse9 (select v_prenex_14 .cse14)) (.cse12 (select v_prenex_14 .cse13))) (and (= main_y (mod (+ .cse8 1) 256)) (= .cse9 .cse10) (= 1000 (select v_prenex_14 (+ v_subst_3 (- 1)))) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse11 (store v_prenex_14 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse8))) main_a) (= main_x .cse8) (= 1000 .cse10) (= (select v_prenex_14 .cse8) .cse9) (= .cse9 .cse12)))))) [2019-01-18 14:49:37,693 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse5 (select main_a main_x))) (or (let ((.cse7 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (let ((.cse6 (mod v_subst_2 256)) (.cse4 (mod (+ .cse7 1) 256))) (let ((.cse2 (mod (+ .cse4 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a (mod (+ .cse6 1) 256))) (.cse3 (select main_a .cse7))) (and (= .cse0 1000) (= .cse1 1000) (= (select main_a .cse2) .cse3) (= .cse4 main_x) (= main_y .cse2) (= 0 (select main_a v_subst_2)) (= .cse5 .cse3) (= .cse0 (select main_a .cse6)) (= .cse1 .cse3))))) (let ((.cse13 (mod (+ v_subst_3 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse9 (select main_a .cse12)) (.cse11 (select main_a .cse13)) (.cse8 (mod (+ .cse12 1) 256)) (.cse10 (select main_a v_subst_3))) (and (= main_y (mod (+ .cse8 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= .cse9 .cse5) (= v_subst_3 (mod v_subst_3 256)) (= .cse9 (select main_a main_y)) (= .cse10 .cse11) (= .cse9 .cse11) (= main_x .cse8) (= .cse10 1000))))))) [2019-01-18 14:49:48,406 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-18 14:49:48,476 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-01-18 14:49:50,041 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 VALID [2019-01-18 14:49:52,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))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2019-01-18 14:49:54,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))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} is UNKNOWN [2019-01-18 14:49:56,077 INFO L273 TraceCheckUtils]: 4: Hoare triple {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} is UNKNOWN [2019-01-18 14:49:56,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} assume a[x] == 0; {192#false} is VALID [2019-01-18 14:49:56,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2019-01-18 14:49:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:49:56,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:50:06,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-18 14:50:06,443 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-01-18 14:50:06,444 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-01-18 14:50:06,615 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-01-18 14:50:06,681 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-01-18 14:50:06,771 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-01-18 14:50:06,773 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-01-18 14:50:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 14:50:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:50:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-01-18 14:50:06,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:50:06,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 14:50:06,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:50:06,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-01-18 14:50:13,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 11 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-01-18 14:50:13,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 14:50:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 14:50:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=134, Unknown=3, NotChecked=0, Total=210 [2019-01-18 14:50:13,360 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-01-18 14:50:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:49,832 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-18 14:50:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 14:50:49,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 14:50:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:50:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 14:50:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-18 14:50:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 14:50:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-18 14:50:49,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2019-01-18 14:50:57,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 15 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-01-18 14:50:57,077 INFO L225 Difference]: With dead ends: 15 [2019-01-18 14:50:57,078 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 14:50:57,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=73, Invalid=134, Unknown=3, NotChecked=0, Total=210 [2019-01-18 14:50:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 14:50:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 14:50:57,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:50:57,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-18 14:50:57,138 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-18 14:50:57,138 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-18 14:50:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:57,139 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 14:50:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 14:50:57,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:50:57,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:50:57,140 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-18 14:50:57,140 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-18 14:50:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:57,141 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 14:50:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 14:50:57,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:50:57,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:50:57,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:50:57,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:50:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 14:50:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 14:50:57,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-01-18 14:50:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:50:57,143 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 14:50:57,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 14:50:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 14:50:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 14:50:57,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:50:57,144 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-18 14:50:57,144 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:50:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:50:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2019-01-18 14:50:57,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:50:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:57,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 14:50:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:57,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:50:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:50:57,820 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-01-18 14:50:58,195 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-01-18 14:50:58,452 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-01-18 14:50:58,457 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-01-18 14:50:58,459 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-01-18 14:50:58,461 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-01-18 14:50:58,462 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-01-18 14:50:58,464 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-01-18 14:50:58,465 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-01-18 14:50:58,466 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-01-18 14:50:58,468 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-01-18 14:50:58,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(not (= 0 (select main_a main_x)))} assume a[x] == 0; {314#false} is VALID [2019-01-18 14:50:58,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-18 14:50:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-18 14:50:58,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:50:58,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:50:58,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 14:50:58,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 14:50:58,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:50:58,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:50:58,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:50:58,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:51:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:51:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:51:00,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:51:00,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:51:00,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:00,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:00,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:51:00,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:00,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:00,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:00,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:51:00,997 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:51:00,998 WARN L385 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-01-18 14:51:00,998 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:51:01,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2019-01-18 14:51:01,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-18 14:51:01,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:01,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:01,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-18 14:51:01,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:01,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-18 14:51:01,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:01,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:01,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 14:51:01,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-18 14:51:03,342 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:51:03,342 WARN L385 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-01-18 14:51:03,342 WARN L386 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-01-18 14:51:03,754 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-18 14:51:03,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:03,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:03,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:03,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-18 14:51:03,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:03,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:03,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:03,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:03,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-18 14:51:03,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:03,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:04,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,010 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:51:04,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 130 [2019-01-18 14:51:04,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:04,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 126 [2019-01-18 14:51:04,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:04,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:04,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:51:04,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-18 14:51:06,267 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:51:06,267 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_16, main_xold, v_main_a_30, v_subst_4]. (or (let ((.cse3 (select v_prenex_16 main_xold)) (.cse0 (select v_prenex_16 (+ main_xold (- 1)))) (.cse1 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 (select v_prenex_16 .cse1)) (= main_x .cse1) (= 1000 .cse0) (= (let ((.cse2 (store v_prenex_16 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1))) main_a) (= .cse3 .cse0) (= main_y (mod (+ .cse1 1) 256)))) (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-01-18 14:51:06,267 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, v_subst_4]. (or (let ((.cse2 (mod (+ main_xold 1) 256))) (let ((.cse1 (select main_a (+ main_xold (- 1)))) (.cse0 (select main_a main_xold)) (.cse3 (mod (+ .cse2 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 .cse1) (= (select main_a main_x) .cse0) (= main_x .cse2) (= main_y .cse3) (= 1000 .cse1) (= .cse0 (select main_a .cse3))))) (let ((.cse7 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse6 (select main_a (+ v_subst_4 (- 1)))) (.cse4 (select main_a .cse7))) (and (= .cse4 (select main_a .cse5)) (= 0 (select main_a v_subst_4)) (= 1000 .cse6) (= main_y (mod (+ .cse5 1) 256)) (= .cse4 .cse6) (= .cse4 (select main_a main_y)) (= main_x (mod (+ .cse7 1) 256)))))) [2019-01-18 14:51:07,470 WARN L181 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-01-18 14:51:07,484 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:51:07,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:07,543 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:51:08,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,176 INFO L303 Elim1Store]: Index analysis took 697 ms [2019-01-18 14:51:08,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 259 [2019-01-18 14:51:08,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 178 [2019-01-18 14:51:08,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:08,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:08,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 171 [2019-01-18 14:51:08,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:08,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 127 [2019-01-18 14:51:08,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:08,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:09,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:51:09,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2019-01-18 14:51:11,052 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:51:11,053 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_17, v_subst_4, v_main_a_31, v_subst_5]. (or (let ((.cse6 (mod v_subst_4 256)) (.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse0 (mod (+ .cse5 1) 256)) (.cse4 (select v_prenex_17 (+ v_subst_4 (- 1)))) (.cse1 (select v_prenex_17 .cse6)) (.cse3 (mod (+ .cse6 1) 256))) (and (= (select v_prenex_17 .cse0) .cse1) (= (let ((.cse2 (store v_prenex_17 main_x (select v_prenex_17 .cse3)))) (store .cse2 main_y (select .cse2 .cse0))) main_a) (= .cse4 1000) (= (select v_prenex_17 .cse5) .cse1) (= (select v_prenex_17 v_subst_4) 0) (= main_y (mod (+ .cse0 1) 256)) (= .cse4 .cse1) (= main_x (mod (+ .cse3 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-01-18 14:51:11,053 WARN L386 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)))) (= .cse3 1000) (= main_y (mod (+ .cse1 1) 256)) (= 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-01-18 14:51:13,692 WARN L181 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 57 [2019-01-18 14:51:16,545 WARN L181 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-18 14:51:16,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 298 [2019-01-18 14:51:16,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:16,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 214 [2019-01-18 14:51:16,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:16,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:18,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,539 INFO L303 Elim1Store]: Index analysis took 245 ms [2019-01-18 14:51:18,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 378 [2019-01-18 14:51:18,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:18,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 287 [2019-01-18 14:51:18,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:19,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:19,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:51:19,409 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2019-01-18 14:51:21,431 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:51:21,431 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_18, 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 ((.cse0 (select v_prenex_18 v_subst_5)) (.cse3 (select v_prenex_18 .cse6)) (.cse2 (select v_prenex_18 .cse5)) (.cse1 (mod (+ .cse5 1) 256))) (and (= .cse0 1000) (= main_x .cse1) (= .cse0 (select v_prenex_18 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= .cse0 .cse3) (= .cse3 (select v_prenex_18 .cse1)) (= (let ((.cse4 (store v_prenex_18 main_x .cse2))) (store .cse4 main_y (select .cse4 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse1 1) 256)))))) (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-01-18 14:51:21,432 WARN L386 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-01-18 14:51:29,745 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 64 [2019-01-18 14:51:38,029 WARN L181 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-18 14:51:38,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,191 INFO L303 Elim1Store]: Index analysis took 148 ms [2019-01-18 14:51:38,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 491 [2019-01-18 14:51:38,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:38,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 367 [2019-01-18 14:51:38,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:38,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:44,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:44,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:44,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:44,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:44,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:44,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:45,811 INFO L303 Elim1Store]: Index analysis took 1270 ms [2019-01-18 14:51:45,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 585 [2019-01-18 14:51:45,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:46,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:46,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:46,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:46,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:46,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:51:46,080 INFO L303 Elim1Store]: Index analysis took 177 ms [2019-01-18 14:51:46,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 450 [2019-01-18 14:51:46,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:51:47,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:51:48,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:51:48,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2019-01-18 14:51:50,440 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:51:50,440 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_33, v_subst_4, v_prenex_19, v_subst_5]. (or (let ((.cse7 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse6 (mod (+ .cse8 1) 256))) (let ((.cse4 (select v_main_a_33 (+ v_subst_4 (- 1)))) (.cse2 (select v_main_a_33 .cse8)) (.cse1 (select v_main_a_33 .cse7)) (.cse0 (mod (+ .cse6 1) 256)) (.cse3 (select v_main_a_33 .cse6))) (and (= main_y (mod (+ .cse0 1) 256)) (= .cse1 1000) (= .cse2 (select v_main_a_33 .cse0)) (= (select v_main_a_33 v_subst_4) 0) (= .cse2 .cse3) (= (select v_main_a_33 (mod v_subst_4 256)) .cse4) (= .cse0 main_x) (= 1000 .cse4) (= .cse2 .cse1) (= (let ((.cse5 (store v_main_a_33 main_x .cse3))) (store .cse5 main_y (select .cse5 .cse0))) main_a)))))) (let ((.cse15 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse15 1) 256))) (let ((.cse16 (mod (+ .cse17 1) 256))) (let ((.cse10 (select v_prenex_19 .cse17)) (.cse12 (select v_prenex_19 .cse16)) (.cse9 (mod (+ .cse16 1) 256)) (.cse14 (select v_prenex_19 v_subst_5)) (.cse11 (select v_prenex_19 .cse15))) (and (= main_x .cse9) (= .cse10 .cse11) (= (select v_prenex_19 .cse9) .cse10) (= .cse12 .cse10) (= (let ((.cse13 (store v_prenex_19 main_x .cse12))) (store .cse13 main_y (select .cse13 .cse9))) main_a) (= main_y (mod (+ .cse9 1) 256)) (= .cse14 (select v_prenex_19 (+ v_subst_5 (- 1)))) (= 1000 .cse11) (= .cse14 .cse11) (= v_subst_5 (mod v_subst_5 256)))))))) [2019-01-18 14:51:50,440 WARN L386 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 ((.cse10 (select main_a v_subst_5)) (.cse9 (select main_a .cse15)) (.cse13 (select main_a .cse16)) (.cse12 (mod (+ .cse15 1) 256)) (.cse11 (select main_a .cse14))) (and (= .cse9 .cse6) (= .cse10 .cse11) (= main_x .cse12) (= .cse10 (select main_a (+ v_subst_5 (- 1)))) (= .cse13 1000) (= .cse9 .cse4) (= .cse9 .cse13) (= main_y (mod (+ .cse12 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= .cse11 1000)))))))) [2019-01-18 14:52:04,313 WARN L181 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 72 [2019-01-18 14:52:25,770 WARN L181 SmtUtils]: Spent 21.37 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-01-18 14:52:25,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:26,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:27,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:29,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,120 INFO L303 Elim1Store]: Index analysis took 4280 ms [2019-01-18 14:52:30,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 876 [2019-01-18 14:52:30,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:30,474 INFO L303 Elim1Store]: Index analysis took 294 ms [2019-01-18 14:52:30,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 713 [2019-01-18 14:52:30,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:52:33,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:52:53,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 746 [2019-01-18 14:52:53,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:54,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:54,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:54,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:54,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:54,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:54,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:52:54,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 574 [2019-01-18 14:52:54,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:52:54,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:52:57,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:52:57,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:547, output treesize:445 [2019-01-18 14:52:59,341 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:52:59,342 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_20, v_subst_5, v_main_a_34, v_subst_4]. (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse9 (mod (+ .cse7 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse2 (select v_prenex_20 v_subst_5)) (.cse1 (mod (+ .cse10 1) 256)) (.cse5 (select v_prenex_20 .cse10)) (.cse4 (select v_prenex_20 .cse9)) (.cse0 (select v_prenex_20 .cse8)) (.cse3 (select v_prenex_20 .cse7))) (and (= .cse0 (select v_prenex_20 .cse1)) (= main_x .cse1) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 (select v_prenex_20 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= 1000 .cse4) (= .cse0 .cse5) (= (let ((.cse6 (store v_prenex_20 main_x .cse5))) (store .cse6 main_y (select .cse6 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 .cse0) (= .cse3 1000))))))) (let ((.cse17 (mod (+ v_subst_4 1) 256))) (let ((.cse18 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse18 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse11 (select v_main_a_34 .cse20)) (.cse14 (mod (+ .cse20 1) 256)) (.cse12 (select v_main_a_34 .cse19)) (.cse13 (select v_main_a_34 .cse18)) (.cse15 (select v_main_a_34 (+ v_subst_4 (- 1))))) (and (= .cse11 .cse12) (= .cse13 .cse12) (= main_y (mod (+ .cse14 1) 256)) (= .cse15 1000) (= (select v_main_a_34 v_subst_4) 0) (= .cse13 1000) (= main_a (let ((.cse16 (store v_main_a_34 main_x .cse11))) (store .cse16 main_y (select .cse16 .cse14)))) (= main_x .cse14) (= (select v_main_a_34 .cse14) .cse12) (= .cse13 (select v_main_a_34 .cse17)) (= .cse15 (select v_main_a_34 (mod v_subst_4 256)))))))))) [2019-01-18 14:52:59,342 WARN L386 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) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse5) (= .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 ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse12 (select main_a .cse20)) (.cse16 (select main_a (+ v_subst_4 (- 1)))) (.cse13 (select main_a .cse19)) (.cse15 (select main_a .cse18)) (.cse14 (mod (+ .cse17 1) 256))) (and (= (select main_a .cse11) .cse12) (= .cse13 .cse12) (= 1000 .cse12) (= main_y .cse14) (= 0 (select main_a v_subst_4)) (= .cse15 .cse0) (= 1000 .cse16) (= (select main_a (mod v_subst_4 256)) .cse16) (= main_x .cse17) (= .cse13 .cse15) (= .cse15 (select main_a .cse14))))))))))) [2019-01-18 14:53:22,752 WARN L181 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 81 [2019-01-18 14:53:41,920 WARN L181 SmtUtils]: Spent 18.30 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-18 14:53:42,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:42,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:42,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:42,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:42,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:42,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:42,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:42,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:43,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:44,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:45,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,065 INFO L303 Elim1Store]: Index analysis took 4130 ms [2019-01-18 14:53:46,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 1173 [2019-01-18 14:53:46,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:53:46,302 INFO L303 Elim1Store]: Index analysis took 166 ms [2019-01-18 14:53:46,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 1238 [2019-01-18 14:53:46,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:53:51,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:54:32,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,625 INFO L303 Elim1Store]: Index analysis took 222 ms [2019-01-18 14:54:32,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 1091 [2019-01-18 14:54:32,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:54:32,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 863 [2019-01-18 14:54:32,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:54:34,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:54:38,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:54:38,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:689, output treesize:557 [2019-01-18 14:54:40,154 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:54:40,154 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_subst_4, v_prenex_21, v_subst_5]. (or (let ((.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse9 (mod (+ .cse11 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse7 (select v_main_a_35 .cse10)) (.cse0 (select v_main_a_35 .cse11)) (.cse4 (select v_main_a_35 (+ v_subst_4 (- 1)))) (.cse2 (mod (+ .cse10 1) 256)) (.cse1 (select v_main_a_35 .cse9)) (.cse3 (select v_main_a_35 .cse8))) (and (= .cse0 .cse1) (= (select v_main_a_35 .cse2) .cse3) (= .cse4 (select v_main_a_35 (mod v_subst_4 256))) (= .cse0 (select v_main_a_35 .cse5)) (= (select v_main_a_35 v_subst_4) 0) (= main_x .cse2) (= (let ((.cse6 (store v_main_a_35 main_x .cse7))) (store .cse6 main_y (select .cse6 .cse2))) main_a) (= .cse7 .cse3) (= .cse0 1000) (= .cse4 1000) (= main_y (mod (+ .cse2 1) 256)) (= .cse1 .cse3)))))))) (let ((.cse24 (mod (+ v_subst_5 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse20 (mod (+ .cse22 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse12 (select v_prenex_21 .cse24)) (.cse13 (mod (+ .cse21 1) 256)) (.cse15 (select v_prenex_21 .cse23)) (.cse17 (select v_prenex_21 v_subst_5)) (.cse16 (select v_prenex_21 .cse22)) (.cse19 (select v_prenex_21 .cse21)) (.cse14 (select v_prenex_21 .cse20))) (and (= .cse12 1000) (= (select v_prenex_21 .cse13) .cse14) (= .cse15 .cse16) (= .cse12 .cse17) (= (mod (+ .cse13 1) 256) main_y) (= main_x .cse13) (= main_a (let ((.cse18 (store v_prenex_21 main_x .cse19))) (store .cse18 main_y (select .cse18 .cse13)))) (= 1000 .cse15) (= .cse17 (select v_prenex_21 (+ v_subst_5 (- 1)))) (= .cse14 .cse16) (= .cse19 .cse14) (= v_subst_5 (mod v_subst_5 256)))))))))) [2019-01-18 14:54:40,155 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse7 (select main_a main_y))) (or (let ((.cse2 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse2 1) 256))) (let ((.cse4 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse4 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a .cse10)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse8 1) 256)) (.cse6 (select main_a .cse9)) (.cse1 (select main_a .cse8))) (and (= (select main_a .cse0) .cse1) (= (select main_a .cse2) .cse3) (= (select main_a .cse4) .cse3) (= 1000 .cse3) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= main_x .cse0) (= .cse6 1000) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse7 .cse1) (= main_y (mod (+ .cse0 1) 256)) (= .cse6 .cse1)))))))) (let ((.cse18 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse21 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse21 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse12 (select main_a v_subst_5)) (.cse15 (mod (+ .cse20 1) 256)) (.cse14 (select main_a .cse21)) (.cse16 (select main_a .cse20)) (.cse11 (select main_a .cse19)) (.cse13 (select main_a .cse18))) (and (= 1000 .cse11) (= .cse12 .cse13) (= .cse14 .cse11) (= .cse12 (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse15 1) 256) main_y) (= main_x .cse15) (= .cse16 (select main_a main_x)) (= .cse14 (select main_a .cse17)) (= .cse16 .cse7) (= .cse16 .cse11) (= v_subst_5 (mod v_subst_5 256)) (= .cse13 1000)))))))))) [2019-01-18 14:55:12,391 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 89 [2019-01-18 14:55:41,429 WARN L181 SmtUtils]: Spent 28.91 s on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-01-18 14:55:41,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:41,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:41,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:42,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:42,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:42,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:42,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:42,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:44,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:44,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:44,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:45,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:45,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:45,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:45,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:45,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:45,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:45,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:46,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:46,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:47,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:47,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:47,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:47,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:48,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:48,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:48,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:48,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:48,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:49,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:49,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:49,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:50,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:50,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:50,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:51,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:51,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:51,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:52,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:52,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:52,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,263 INFO L303 Elim1Store]: Index analysis took 11816 ms [2019-01-18 14:55:53,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 1732 [2019-01-18 14:55:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:55:53,954 INFO L303 Elim1Store]: Index analysis took 610 ms [2019-01-18 14:55:53,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 57 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 1417 [2019-01-18 14:55:53,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:56:03,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:56:46,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:46,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,451 INFO L303 Elim1Store]: Index analysis took 603 ms [2019-01-18 14:56:47,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 1540 [2019-01-18 14:56:47,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:56:47,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 1248 [2019-01-18 14:56:47,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:56:49,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:56:58,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:56:58,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:841, output treesize:653 [2019-01-18 14:57:00,627 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:57:00,628 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_22, v_subst_4, v_main_a_36, v_subst_5]. (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse6 1) 256))) (let ((.cse5 (mod (+ .cse12 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse10 (mod (+ .cse11 1) 256))) (let ((.cse9 (mod (+ .cse10 1) 256))) (let ((.cse4 (select v_prenex_22 (+ v_subst_4 (- 1)))) (.cse0 (select v_prenex_22 .cse12)) (.cse2 (select v_prenex_22 .cse11)) (.cse1 (mod (+ .cse9 1) 256)) (.cse3 (select v_prenex_22 .cse10)) (.cse8 (select v_prenex_22 .cse9))) (and (= 1000 .cse0) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 .cse3) (= .cse3 (select v_prenex_22 .cse1)) (= main_x .cse1) (= .cse4 (select v_prenex_22 (mod v_subst_4 256))) (= 0 (select v_prenex_22 v_subst_4)) (= (select v_prenex_22 .cse5) .cse0) (= .cse4 1000) (= .cse0 (select v_prenex_22 .cse6)) (= .cse2 1000) (= (let ((.cse7 (store v_prenex_22 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse1))) main_a) (= .cse3 .cse8))))))))) (let ((.cse25 (mod (+ v_subst_5 1) 256))) (let ((.cse21 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse26 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse26 1) 256))) (let ((.cse15 (select v_main_a_36 .cse26)) (.cse18 (select v_main_a_36 v_subst_5)) (.cse13 (select v_main_a_36 .cse25)) (.cse17 (mod (+ .cse24 1) 256)) (.cse14 (select v_main_a_36 .cse24)) (.cse20 (select v_main_a_36 .cse23)) (.cse16 (select v_main_a_36 .cse22))) (and (= 1000 .cse13) (= .cse14 .cse15) (= .cse15 .cse16) (= .cse17 main_x) (= (select v_main_a_36 (+ v_subst_5 (- 1))) .cse18) (= (select v_main_a_36 .cse17) .cse15) (= .cse18 .cse13) (= main_y (mod (+ .cse17 1) 256)) (= 1000 .cse16) (= (let ((.cse19 (store v_main_a_36 main_x .cse14))) (store .cse19 main_y (select .cse19 .cse17))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse20 (select v_main_a_36 .cse21)) (= .cse20 .cse16)))))))))) [2019-01-18 14:57:00,628 WARN L386 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 ((.cse8 (mod (+ .cse10 1) 256))) (let ((.cse5 (mod (+ .cse8 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)) (.cse9 (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) (= (select main_a .cse8) .cse7) (= 1000 .cse7) (= 0 (select main_a v_subst_4)) (= 1000 .cse9) (= (select main_a (mod v_subst_4 256)) .cse9))))))))) (let ((.cse21 (mod (+ v_subst_5 1) 256))) (let ((.cse20 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse20 1) 256))) (let ((.cse25 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse13 (select main_a .cse25)) (.cse15 (mod (+ .cse23 1) 256)) (.cse18 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse17 (select main_a v_subst_5)) (.cse16 (select main_a .cse22)) (.cse19 (select main_a .cse21))) (and (= 1000 .cse13) (= .cse2 .cse14) (= .cse4 .cse14) (= .cse15 main_x) (= .cse16 .cse13) (= .cse17 (select main_a (+ v_subst_5 (- 1)))) (= .cse18 1000) (= main_y (mod (+ .cse15 1) 256)) (= .cse18 .cse14) (= .cse17 .cse19) (= .cse16 (select main_a .cse20)) (= v_subst_5 (mod v_subst_5 256)) (= .cse19 1000))))))))))) [2019-01-18 14:57:46,337 WARN L181 SmtUtils]: Spent 4.21 s on a formula simplification that was a NOOP. DAG size: 96 [2019-01-18 14:57:46,418 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-01-18 14:57:48,426 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 UNKNOWN [2019-01-18 14:57:50,435 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-01-18 14:57:52,445 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-01-18 14:57:54,455 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-01-18 14:57:56,465 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-01-18 14:57:58,479 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 (+ (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))) (= 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)) (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-01-18 14:58:00,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {347#(or (exists ((v_subst_4 Int)) (and (= (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))) (= 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)) (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_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 (+ (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)) (= 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 (+ (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))))) (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 (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))) (= (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) (= 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))))} is UNKNOWN [2019-01-18 14:58:02,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(or (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 (+ (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)) (= 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 (+ (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))))) (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 (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))) (= (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) (= 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))))} 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_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 (+ (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)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (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))) (= (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))) (= (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 (+ (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-01-18 14:58:02,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#(or (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 (+ (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)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (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))) (= (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))) (= (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 (+ (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))))} assume a[x] == 0; {314#false} is VALID [2019-01-18 14:58:02,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-18 14:58:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:58:02,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:58:26,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {314#false} is VALID [2019-01-18 14:58:26,272 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-01-18 14:58:26,274 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-01-18 14:58:26,334 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-01-18 14:58:26,517 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-01-18 14:58:26,640 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-01-18 14:58:26,783 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-01-18 14:58:26,893 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-01-18 14:58:27,029 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-01-18 14:58:27,176 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-01-18 14:58:27,177 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-01-18 14:58:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 14:58:27,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:58:27,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 4] total 19 [2019-01-18 14:58:27,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:58:27,197 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-18 14:58:27,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:58:27,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-01-18 14:58:41,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 12 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2019-01-18 14:58:41,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 14:58:41,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 14:58:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=211, Unknown=47, NotChecked=0, Total=380 [2019-01-18 14:58:41,845 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-01-18 15:01:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 15:01:29,877 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-18 15:01:29,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 15:01:29,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-18 15:01:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 15:01:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 15:01:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-18 15:01:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 15:01:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-18 15:01:29,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 14 transitions. [2019-01-18 15:01:45,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 7 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2019-01-18 15:01:45,033 INFO L225 Difference]: With dead ends: 13 [2019-01-18 15:01:45,034 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 15:01:45,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 139.7s TimeCoverageRelationStatistics Valid=122, Invalid=211, Unknown=47, NotChecked=0, Total=380 [2019-01-18 15:01:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 15:01:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 15:01:45,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 15:01:45,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-18 15:01:45,035 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 15:01:45,035 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 15:01:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 15:01:45,035 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 15:01:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 15:01:45,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 15:01:45,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 15:01:45,035 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 15:01:45,035 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 15:01:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 15:01:45,036 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 15:01:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 15:01:45,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 15:01:45,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 15:01:45,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 15:01:45,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 15:01:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 15:01:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 15:01:45,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-18 15:01:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 15:01:45,037 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 15:01:45,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 15:01:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 15:01:45,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 15:01:45,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 15:02:07,253 WARN L181 SmtUtils]: Spent 22.16 s on a formula simplification. DAG size of input: 374 DAG size of output: 35 [2019-01-18 15:02:07,262 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 9 30) no Hoare annotation was computed. [2019-01-18 15:02:07,262 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-18 15:02:07,262 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 9 30) no Hoare annotation was computed. [2019-01-18 15:02:07,263 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 30) no Hoare annotation was computed. [2019-01-18 15:02:07,263 INFO L444 ceAbstractionStarter]: At program point L18-1(lines 18 29) the Hoare annotation is: (let ((.cse0 (select main_a main_x)) (.cse1 (select main_a main_y))) (or (and (= .cse0 1000) (= .cse1 0) (= main_y (+ main_x 1))) (and (= .cse0 .cse1) (not (= 0 .cse1))) (exists ((main_yold Int)) (let ((.cse2 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse2) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) .cse2) (= (select main_a main_x) .cse3) (= 1000 .cse3)))))) [2019-01-18 15:02:07,263 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 28) no Hoare annotation was computed. [2019-01-18 15:02:07,264 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-18 15:02:09,272 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-18 15:02:09,272 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-01-18 15:02:09,273 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-18 15:02:09,273 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-18 15:02:09,273 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-01-18 15:02:09,273 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-01-18 15:02:09,279 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 03:02:09 BoogieIcfgContainer [2019-01-18 15:02:09,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 15:02:09,282 INFO L168 Benchmark]: Toolchain (without parser) took 830489.66 ms. Allocated memory was 136.8 MB in the beginning and 625.5 MB in the end (delta: 488.6 MB). Free memory was 104.4 MB in the beginning and 255.3 MB in the end (delta: -150.9 MB). Peak memory consumption was 337.7 MB. Max. memory is 7.1 GB. [2019-01-18 15:02:09,283 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory is still 105.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 15:02:09,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 136.8 MB. Free memory was 104.2 MB in the beginning and 102.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-18 15:02:09,283 INFO L168 Benchmark]: Boogie Preprocessor took 22.34 ms. Allocated memory is still 136.8 MB. Free memory was 102.4 MB in the beginning and 101.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 15:02:09,284 INFO L168 Benchmark]: RCFGBuilder took 283.04 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-18 15:02:09,284 INFO L168 Benchmark]: TraceAbstraction took 830144.45 ms. Allocated memory was 136.8 MB in the beginning and 625.5 MB in the end (delta: 488.6 MB). Free memory was 91.0 MB in the beginning and 255.3 MB in the end (delta: -164.3 MB). Peak memory consumption was 324.3 MB. Max. memory is 7.1 GB. [2019-01-18 15:02:09,288 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.20 ms. Allocated memory is still 136.8 MB. Free memory is still 105.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 136.8 MB. Free memory was 104.2 MB in the beginning and 102.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.34 ms. Allocated memory is still 136.8 MB. Free memory was 102.4 MB in the beginning and 101.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 283.04 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 830144.45 ms. Allocated memory was 136.8 MB in the beginning and 625.5 MB in the end (delta: 488.6 MB). Free memory was 91.0 MB in the beginning and 255.3 MB in the end (delta: -164.3 MB). Peak memory consumption was 324.3 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, 828.0s OverallTime, 5 OverallIterations, 8 TraceHistogramMax, 251.9s AutomataDifference, 0.0s DeadEndRemovalTime, 22.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 78 SolverSat, 9 SolverUnsat, 53 SolverUnknown, 0 SolverNotchecked, 112.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 161.2s 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, 4.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s 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, 3453 FormulaSimplificationTreeSizeReductionInter, 22.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 519.1s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 18 QuantifiedInterpolants, 58064 SizeOfPredicates, 38 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 32/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...