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-4b9831f [2018-12-23 14:35:34,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:35:34,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:35:34,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:35:34,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:35:34,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:35:34,644 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:35:34,646 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:35:34,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:35:34,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:35:34,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:35:34,650 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:35:34,651 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:35:34,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:35:34,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:35:34,654 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:35:34,655 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:35:34,657 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:35:34,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:35:34,661 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:35:34,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:35:34,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:35:34,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:35:34,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:35:34,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:35:34,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:35:34,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:35:34,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:35:34,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:35:34,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:35:34,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:35:34,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:35:34,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:35:34,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:35:34,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:35:34,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:35:34,677 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 [2018-12-23 14:35:34,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:35:34,691 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:35:34,691 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:35:34,692 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:35:34,692 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:35:34,692 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:35:34,692 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:35:34,693 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:35:34,693 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:35:34,693 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-23 14:35:34,693 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-23 14:35:34,693 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:35:34,693 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:35:34,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:35:34,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:35:34,695 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:35:34,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:35:34,695 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:35:34,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:35:34,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:35:34,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:35:34,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:35:34,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:35:34,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:35:34,696 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:35:34,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:35:34,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:35:34,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:35:34,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:35:34,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:35:34,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:35:34,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:35:34,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:35:34,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:35:34,699 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:35:34,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:35:34,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:35:34,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:35:34,700 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:35:34,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:35:34,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:35:34,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:35:34,762 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:35:34,763 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:35:34,764 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2018-12-23 14:35:34,764 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2018-12-23 14:35:34,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:35:34,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:35:34,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:35:34,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:35:34,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:35:34,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,856 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-23 14:35:34,857 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-23 14:35:34,857 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-23 14:35:34,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:35:34,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:35:34,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:35:34,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:35:34,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/1) ... [2018-12-23 14:35:34,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:35:34,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:35:34,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:35:34,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:35:34,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (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 [2018-12-23 14:35:34,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-23 14:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-23 14:35:34,975 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-23 14:35:35,270 INFO L272 CfgBuilder]: Using library mode [2018-12-23 14:35:35,271 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-23 14:35:35,272 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:35:35 BoogieIcfgContainer [2018-12-23 14:35:35,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:35:35,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:35:35,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:35:35,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:35:35,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:35:34" (1/2) ... [2018-12-23 14:35:35,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24af8fcc and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:35:35, skipping insertion in model container [2018-12-23 14:35:35,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:35:35" (2/2) ... [2018-12-23 14:35:35,282 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2018-12-23 14:35:35,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:35:35,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-23 14:35:35,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-23 14:35:35,368 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:35:35,369 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:35:35,369 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:35:35,369 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:35:35,369 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:35:35,369 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:35:35,370 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:35:35,370 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:35:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-23 14:35:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-23 14:35:35,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:35:35,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-23 14:35:35,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:35:35,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:35:35,419 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-23 14:35:35,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:35:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:35:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:35:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:35:35,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:35:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:35:35,880 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-12-23 14:35:35,975 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 [2018-12-23 14:35:35,982 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 [2018-12-23 14:35:35,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2018-12-23 14:35:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:35:35,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:35:35,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-23 14:35:35,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:35:35,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-23 14:35:35,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:35:35,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:35:36,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:35:36,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:35:36,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:35:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-23 14:35:36,027 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-12-23 14:35:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:35:36,277 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-23 14:35:36,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:35:36,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-23 14:35:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:35:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:35:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-23 14:35:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:35:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-23 14:35:36,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2018-12-23 14:35:36,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:35:36,478 INFO L225 Difference]: With dead ends: 15 [2018-12-23 14:35:36,478 INFO L226 Difference]: Without dead ends: 5 [2018-12-23 14:35:36,482 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 [2018-12-23 14:35:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-23 14:35:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-23 14:35:36,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:35:36,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-23 14:35:36,566 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-23 14:35:36,566 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-23 14:35:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:35:36,568 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-23 14:35:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-23 14:35:36,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:35:36,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:35:36,569 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-23 14:35:36,569 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-23 14:35:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:35:36,570 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-23 14:35:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-23 14:35:36,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:35:36,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:35:36,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:35:36,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:35:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-23 14:35:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-23 14:35:36,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-23 14:35:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:35:36,575 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-23 14:35:36,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:35:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-23 14:35:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-23 14:35:36,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:35:36,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-23 14:35:36,577 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:35:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:35:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-23 14:35:36,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:35:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:35:36,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:35:36,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:35:36,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:35:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:35:36,872 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-23 14:35:36,899 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 [2018-12-23 14:35:36,901 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 [2018-12-23 14:35:36,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2018-12-23 14:35:36,902 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-23 14:35:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:35:36,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:35:36,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:35:36,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-23 14:35:36,907 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-23 14:35:36,970 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-23 14:35:36,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:35:40,923 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-23 14:35:40,924 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. [2018-12-23 14:35:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:35:41,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-23 14:35:41,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:35:41,044 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 [2018-12-23 14:35:41,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:35:41,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-23 14:35:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:35:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:35:41,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:35:41,146 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 [2018-12-23 14:35:41,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,185 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 [2018-12-23 14:35:41,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:41,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:35:41,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:35:41,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-23 14:35:41,218 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:35:41,219 WARN L384 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))) [2018-12-23 14:35:41,219 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-23 14:35:41,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,407 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 [2018-12-23 14:35:41,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,484 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 [2018-12-23 14:35:41,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:41,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,667 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 [2018-12-23 14:35:41,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:41,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-23 14:35:41,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,776 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 [2018-12-23 14:35:41,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,797 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 [2018-12-23 14:35:41,818 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:41,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:41,953 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 [2018-12-23 14:35:41,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:42,510 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-23 14:35:42,601 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. [2018-12-23 14:35:42,602 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2018-12-23 14:35:44,794 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:35:44,795 WARN L384 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))) [2018-12-23 14:35:44,795 WARN L385 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))))))) [2018-12-23 14:35:45,025 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-12-23 14:35:45,091 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 [2018-12-23 14:35:47,106 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 [2018-12-23 14:35:47,126 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 [2018-12-23 14:35:47,126 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-23 14:35:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:35:47,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:35:47,289 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-23 14:35:47,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2018-12-23 14:35:47,293 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 [2018-12-23 14:35:47,295 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 [2018-12-23 14:35:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:35:47,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:35:47,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-23 14:35:47,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:35:47,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-23 14:35:47,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:35:47,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-23 14:35:49,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-23 14:35:49,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-23 14:35:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-23 14:35:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-23 14:35:49,355 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-23 14:35:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:35:53,523 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-23 14:35:53,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:35:53,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-23 14:35:53,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:35:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-23 14:35:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-23 14:35:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-23 14:35:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-23 14:35:53,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2018-12-23 14:35:55,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-23 14:35:55,570 INFO L225 Difference]: With dead ends: 8 [2018-12-23 14:35:55,571 INFO L226 Difference]: Without dead ends: 6 [2018-12-23 14:35:55,571 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 [2018-12-23 14:35:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-23 14:35:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-23 14:35:55,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:35:55,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-23 14:35:55,584 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-23 14:35:55,584 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-23 14:35:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:35:55,585 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-23 14:35:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-23 14:35:55,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:35:55,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:35:55,586 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-23 14:35:55,586 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-23 14:35:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:35:55,587 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-23 14:35:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-23 14:35:55,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:35:55,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:35:55,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:35:55,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:35:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-23 14:35:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-23 14:35:55,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-23 14:35:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:35:55,589 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-23 14:35:55,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-23 14:35:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-23 14:35:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-23 14:35:55,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:35:55,590 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-23 14:35:55,590 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:35:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:35:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-23 14:35:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:35:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:35:55,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:35:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:35:55,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:35:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:35:55,855 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2018-12-23 14:35:55,918 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 [2018-12-23 14:35:55,940 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 [2018-12-23 14:35:55,941 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 [2018-12-23 14:35:55,942 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2018-12-23 14:35:55,943 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-23 14:35:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:35:55,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:35:55,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:35:55,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:35:55,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:35:55,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:35:55,944 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 [2018-12-23 14:35:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-23 14:35:55,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-23 14:35:55,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-23 14:35:55,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-23 14:35:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:35:55,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:35:56,003 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 [2018-12-23 14:35:56,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,012 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 [2018-12-23 14:35:56,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:56,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:35:56,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:35:56,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-23 14:35:56,033 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:35:56,034 WARN L384 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))) [2018-12-23 14:35:56,034 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-23 14:35:56,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,165 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 [2018-12-23 14:35:56,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,189 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 [2018-12-23 14:35:56,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:56,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,259 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 [2018-12-23 14:35:56,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:56,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-23 14:35:56,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,358 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 [2018-12-23 14:35:56,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,403 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 [2018-12-23 14:35:56,406 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:56,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:56,592 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 [2018-12-23 14:35:56,596 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:56,646 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-23 14:35:56,763 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. [2018-12-23 14:35:56,764 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2018-12-23 14:35:58,948 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:35:58,949 WARN L384 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)))) [2018-12-23 14:35:58,949 WARN L385 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)))) [2018-12-23 14:35:59,420 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-23 14:35:59,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,449 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 [2018-12-23 14:35:59,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,488 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 [2018-12-23 14:35:59,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:59,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:35:59,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,544 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 [2018-12-23 14:35:59,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2018-12-23 14:35:59,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:35:59,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:35:59,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,862 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 [2018-12-23 14:35:59,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:35:59,933 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 [2018-12-23 14:35:59,945 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:00,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:00,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,029 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 [2018-12-23 14:36:00,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:00,072 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 [2018-12-23 14:36:00,090 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:00,213 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:00,479 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. [2018-12-23 14:36:00,480 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2018-12-23 14:36:02,709 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:36:02,709 WARN L384 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))))))) [2018-12-23 14:36:02,710 WARN L385 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))))) [2018-12-23 14:36:02,914 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-12-23 14:36:02,991 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 [2018-12-23 14:36:04,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2018-12-23 14:36:07,044 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 [2018-12-23 14:36:07,086 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 [2018-12-23 14:36:07,087 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-23 14:36:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:36:07,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:36:09,062 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-23 14:36:09,063 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2018-12-23 14:36:09,065 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 [2018-12-23 14:36:09,071 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 [2018-12-23 14:36:09,072 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 [2018-12-23 14:36:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-23 14:36:09,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:36:09,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-23 14:36:09,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:36:09,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-23 14:36:09,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:36:09,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-23 14:36:13,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-12-23 14:36:13,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-23 14:36:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-23 14:36:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-23 14:36:13,177 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-23 14:36:22,883 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-12-23 14:36:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:36:27,095 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-12-23 14:36:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-23 14:36:27,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-23 14:36:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:36:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-23 14:36:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-23 14:36:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-23 14:36:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-23 14:36:27,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2018-12-23 14:36:31,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-12-23 14:36:31,220 INFO L225 Difference]: With dead ends: 10 [2018-12-23 14:36:31,221 INFO L226 Difference]: Without dead ends: 8 [2018-12-23 14:36:31,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-23 14:36:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-23 14:36:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-23 14:36:31,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:36:31,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-23 14:36:31,288 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-23 14:36:31,288 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-23 14:36:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:36:31,290 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-23 14:36:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-23 14:36:31,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:36:31,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:36:31,291 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-23 14:36:31,291 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-23 14:36:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:36:31,292 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-23 14:36:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-23 14:36:31,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:36:31,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:36:31,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:36:31,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:36:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-23 14:36:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-23 14:36:31,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-23 14:36:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:36:31,295 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-23 14:36:31,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-23 14:36:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-23 14:36:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-23 14:36:31,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:36:31,295 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-23 14:36:31,296 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:36:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:36:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2018-12-23 14:36:31,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:36:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:36:31,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-23 14:36:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:36:31,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:36:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:36:31,865 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2018-12-23 14:36:31,969 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 [2018-12-23 14:36:31,990 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 [2018-12-23 14:36:31,992 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 [2018-12-23 14:36:31,994 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 [2018-12-23 14:36:31,995 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 [2018-12-23 14:36:31,995 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 [2018-12-23 14:36:31,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2018-12-23 14:36:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:36:31,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:36:31,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:36:31,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:36:31,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:36:31,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:36:31,998 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 [2018-12-23 14:36:32,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-23 14:36:32,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-23 14:36:32,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-23 14:36:32,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-23 14:36:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:36:32,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:36:32,214 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 [2018-12-23 14:36:32,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,223 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 [2018-12-23 14:36:32,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:32,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:32,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:32,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-23 14:36:32,253 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:36:32,254 WARN L384 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)) [2018-12-23 14:36:32,254 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-23 14:36:32,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,389 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 [2018-12-23 14:36:32,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2018-12-23 14:36:32,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:32,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:32,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,492 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 [2018-12-23 14:36:32,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:32,645 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 [2018-12-23 14:36:32,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:32,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:32,715 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. [2018-12-23 14:36:32,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2018-12-23 14:36:34,721 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:36:34,722 WARN L384 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))) [2018-12-23 14:36:34,722 WARN L385 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))))) [2018-12-23 14:36:35,297 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-23 14:36:35,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,314 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 [2018-12-23 14:36:35,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2018-12-23 14:36:35,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:35,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:35,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,645 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:36:35,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 148 [2018-12-23 14:36:35,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:35,699 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 [2018-12-23 14:36:35,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:35,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:35,900 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. [2018-12-23 14:36:35,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2018-12-23 14:36:37,940 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:36:37,940 WARN L384 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))))) [2018-12-23 14:36:37,941 WARN L385 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)))))) [2018-12-23 14:36:39,022 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-12-23 14:36:39,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,047 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 [2018-12-23 14:36:39,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,098 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 [2018-12-23 14:36:39,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:39,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:39,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,711 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:36:39,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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 [2018-12-23 14:36:39,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:39,805 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 [2018-12-23 14:36:39,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:39,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:40,066 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. [2018-12-23 14:36:40,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2018-12-23 14:36:42,168 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:36:42,169 WARN L384 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)))))) [2018-12-23 14:36:42,169 WARN L385 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)))))) [2018-12-23 14:36:46,157 WARN L181 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2018-12-23 14:36:46,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-23 14:36:46,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:46,280 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 [2018-12-23 14:36:46,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:46,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:48,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,899 INFO L303 Elim1Store]: Index analysis took 482 ms [2018-12-23 14:36:48,900 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 [2018-12-23 14:36:48,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:48,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:49,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:49,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:49,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:36:49,015 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 [2018-12-23 14:36:49,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:36:49,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:36:50,042 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. [2018-12-23 14:36:50,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2018-12-23 14:36:52,078 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:36:52,079 WARN L384 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)))))) [2018-12-23 14:36:52,079 WARN L385 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))))))) [2018-12-23 14:37:00,735 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 67 [2018-12-23 14:37:00,800 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 [2018-12-23 14:37:01,166 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 [2018-12-23 14:37:03,179 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 [2018-12-23 14:37:05,189 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 [2018-12-23 14:37:07,210 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 [2018-12-23 14:37:07,217 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 [2018-12-23 14:37:07,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2018-12-23 14:37:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:37:07,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:37:15,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2018-12-23 14:37:15,766 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 [2018-12-23 14:37:15,768 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 [2018-12-23 14:37:16,009 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 [2018-12-23 14:37:17,909 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 [2018-12-23 14:37:18,270 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 [2018-12-23 14:37:18,273 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 [2018-12-23 14:37:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-23 14:37:18,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:37:18,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2018-12-23 14:37:18,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:37:18,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-23 14:37:18,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:37:18,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-12-23 14:37:26,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 10 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-12-23 14:37:26,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-23 14:37:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-23 14:37:26,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=135, Unknown=3, NotChecked=0, Total=210 [2018-12-23 14:37:26,392 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2018-12-23 14:38:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:38:06,609 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-23 14:38:06,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-23 14:38:06,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-23 14:38:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:38:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-23 14:38:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-23 14:38:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-23 14:38:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-23 14:38:06,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2018-12-23 14:38:14,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 13 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-12-23 14:38:14,046 INFO L225 Difference]: With dead ends: 14 [2018-12-23 14:38:14,046 INFO L226 Difference]: Without dead ends: 11 [2018-12-23 14:38:14,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=72, Invalid=135, Unknown=3, NotChecked=0, Total=210 [2018-12-23 14:38:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-23 14:38:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-23 14:38:14,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:38:14,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2018-12-23 14:38:14,138 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-23 14:38:14,138 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-23 14:38:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:38:14,139 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-23 14:38:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-23 14:38:14,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:38:14,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:38:14,140 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-23 14:38:14,141 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-23 14:38:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:38:14,141 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-23 14:38:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-23 14:38:14,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:38:14,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:38:14,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:38:14,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:38:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-23 14:38:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-23 14:38:14,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-12-23 14:38:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:38:14,143 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-23 14:38:14,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-23 14:38:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-23 14:38:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-23 14:38:14,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:38:14,144 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-23 14:38:14,144 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:38:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:38:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 4 times [2018-12-23 14:38:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:38:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:38:14,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-23 14:38:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:38:14,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:38:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:38:14,688 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2018-12-23 14:38:14,844 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {309#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2018-12-23 14:38:14,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {310#(and (= 1000 (select main_a main_x)) (<= main_y 255) (or (<= (+ main_x 1) main_y) (and (<= main_x 255) (<= (+ main_y 255) main_x))) (<= main_y (+ main_x 1)) (< 0 (+ main_y 1)))} is VALID [2018-12-23 14:38:14,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#(and (= 1000 (select main_a main_x)) (<= main_y 255) (or (<= (+ main_x 1) main_y) (and (<= main_x 255) (<= (+ main_y 255) main_x))) (<= main_y (+ main_x 1)) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {311#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-23 14:38:14,858 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-23 14:38:14,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-23 14:38:14,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-23 14:38:14,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-23 14:38:14,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {313#(= (select main_a main_y) 1000)} is VALID [2018-12-23 14:38:14,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {313#(= (select main_a main_y) 1000)} assume a[x] == 0; {313#(= (select main_a main_y) 1000)} is VALID [2018-12-23 14:38:14,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {313#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {308#false} is VALID [2018-12-23 14:38:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-23 14:38:14,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:38:14,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:38:14,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:38:14,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:38:14,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:38:14,869 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 [2018-12-23 14:38:14,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:38:14,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-23 14:38:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:38:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:38:15,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:38:15,981 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 [2018-12-23 14:38:15,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:15,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:15,998 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 [2018-12-23 14:38:16,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:16,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:16,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:16,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-23 14:38:16,031 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:38:16,031 WARN L384 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))) [2018-12-23 14:38:16,031 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-23 14:38:16,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,176 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 [2018-12-23 14:38:16,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,201 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 46 treesize of output 58 [2018-12-23 14:38:16,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:16,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 74 [2018-12-23 14:38:16,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:16,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-23 14:38:16,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,370 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 [2018-12-23 14:38:16,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,389 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 45 treesize of output 54 [2018-12-23 14:38:16,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:16,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:16,474 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 31 treesize of output 70 [2018-12-23 14:38:16,478 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:16,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-23 14:38:16,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-23 14:38:16,583 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:78 [2018-12-23 14:38:18,704 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:38:18,704 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_29, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse1 (select v_main_a_29 main_xold))) (and (= main_x (mod .cse0 256)) (= .cse1 1000) (= main_y (mod (+ main_xold 2) 256)) (= 0 (select v_main_a_29 .cse0)) (= (let ((.cse2 (store v_main_a_29 main_x .cse1))) (store .cse2 main_y (select .cse2 main_yold))) main_a))) [2018-12-23 14:38:18,704 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_18]. (let ((.cse3 (select main_a main_y)) (.cse0 (select main_a main_x))) (or (let ((.cse1 (select main_a main_xold)) (.cse2 (+ main_xold 1))) (and (= .cse0 .cse1) (= .cse1 1000) (= 0 (select main_a .cse2)) (= main_x (mod .cse2 256)) (= .cse3 (select main_a main_yold)) (= main_y (mod (+ main_xold 2) 256)))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= .cse3 (select main_a v_prenex_18)) (= 1000 .cse4) (= .cse0 .cse4))))) [2018-12-23 14:38:18,889 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-12-23 14:38:19,052 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-23 14:38:19,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 74 [2018-12-23 14:38:19,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,091 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 [2018-12-23 14:38:19,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 75 [2018-12-23 14:38:19,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 76 [2018-12-23 14:38:19,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 125 [2018-12-23 14:38:19,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 135 [2018-12-23 14:38:19,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,752 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 128 [2018-12-23 14:38:19,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:19,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 132 [2018-12-23 14:38:19,816 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,884 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:19,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-23 14:38:19,988 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:131, output treesize:135 [2018-12-23 14:38:22,192 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:38:22,194 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_30, v_subst_4, main_yold, v_prenex_19, main_xold]. (or (let ((.cse1 (+ v_subst_4 1))) (let ((.cse4 (mod .cse1 256))) (let ((.cse0 (select v_main_a_30 v_subst_4)) (.cse2 (select v_main_a_30 .cse4))) (and (= .cse0 1000) (= (select v_main_a_30 .cse1) 0) (= .cse0 .cse2) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= (let ((.cse3 (store v_main_a_30 main_x .cse2))) (store .cse3 main_y (select .cse3 main_yold))) main_a) (= main_x (mod (+ .cse4 1) 256)))))) (let ((.cse6 (select v_prenex_19 (+ main_xold (- 1)))) (.cse5 (select v_prenex_19 main_xold)) (.cse7 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse5 .cse6) (= main_x .cse7) (= 1000 .cse6) (= (let ((.cse8 (store v_prenex_19 main_x .cse5))) (store .cse8 main_y (select .cse8 main_yold))) main_a) (= main_y (mod (+ .cse7 1) 256))))) [2018-12-23 14:38:22,194 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_subst_4, v_prenex_20]. (let ((.cse2 (select main_a main_x))) (or (let ((.cse3 (mod (+ main_xold 1) 256))) (let ((.cse0 (select main_a main_xold)) (.cse4 (mod (+ .cse3 1) 256)) (.cse1 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse0 .cse1) (= .cse2 .cse0) (= main_x .cse3) (= (select main_a .cse4) (select main_a main_yold)) (= main_y .cse4) (= 1000 .cse1)))) (let ((.cse9 (+ v_subst_4 1))) (let ((.cse7 (mod .cse9 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse8 (select main_a .cse7)) (.cse5 (select main_a v_subst_4))) (and (= 1000 .cse5) (= (select main_a .cse6) (select main_a v_prenex_20)) (= main_y .cse6) (= main_x (mod (+ .cse7 1) 256)) (= .cse8 .cse2) (= .cse8 .cse5) (= 0 (select main_a .cse9)))))))) [2018-12-23 14:38:23,506 WARN L181 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-23 14:38:24,398 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-23 14:38:24,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,474 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:38:24,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 296 [2018-12-23 14:38:24,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 317 [2018-12-23 14:38:24,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:24,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:24,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:24,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,107 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:38:25,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,171 INFO L303 Elim1Store]: Index analysis took 215 ms [2018-12-23 14:38:25,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 113 treesize of output 301 [2018-12-23 14:38:25,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:25,686 INFO L303 Elim1Store]: Index analysis took 272 ms [2018-12-23 14:38:25,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 281 treesize of output 325 [2018-12-23 14:38:25,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:26,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:27,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 181 [2018-12-23 14:38:27,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,514 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 172 treesize of output 201 [2018-12-23 14:38:27,525 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:27,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,728 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 85 treesize of output 156 [2018-12-23 14:38:27,732 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:27,811 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:27,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:27,987 INFO L303 Elim1Store]: Index analysis took 168 ms [2018-12-23 14:38:28,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 95 treesize of output 178 [2018-12-23 14:38:28,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 201 [2018-12-23 14:38:28,102 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:28,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:28,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 156 [2018-12-23 14:38:28,819 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:28,904 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:29,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-23 14:38:29,163 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:223, output treesize:278 [2018-12-23 14:38:31,298 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:38:31,299 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_31, v_subst_5, main_yold, v_prenex_21, v_prenex_23, v_subst_4, v_prenex_20]. (or (let ((.cse5 (mod (+ v_subst_5 1) 256))) (let ((.cse1 (select v_main_a_31 (+ v_subst_5 (- 1)))) (.cse0 (select v_main_a_31 v_subst_5)) (.cse4 (select v_main_a_31 .cse5)) (.cse2 (mod (+ .cse5 1) 256))) (and (= .cse0 .cse1) (= (select v_main_a_31 v_prenex_21) (select v_main_a_31 .cse2)) (= (let ((.cse3 (store v_main_a_31 main_x .cse4))) (store .cse3 main_y (select .cse3 main_yold))) main_a) (= 1000 .cse1) (= .cse0 .cse4) (= main_y (mod (+ .cse2 1) 256)) (= main_x .cse2) (= v_subst_5 (mod v_subst_5 256))))) (let ((.cse10 (+ v_subst_4 1))) (let ((.cse13 (mod .cse10 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse7 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse8 (select v_prenex_23 .cse12)) (.cse6 (select v_prenex_23 v_subst_4)) (.cse9 (select v_prenex_23 .cse13))) (and (= .cse6 1000) (= (select v_prenex_23 .cse7) (select v_prenex_23 v_prenex_20)) (= .cse8 .cse9) (= (mod (+ .cse7 1) 256) main_y) (= 0 (select v_prenex_23 .cse10)) (= (let ((.cse11 (store v_prenex_23 main_x .cse8))) (store .cse11 main_y (select .cse11 main_yold))) main_a) (= .cse6 .cse9) (= main_x (mod (+ .cse12 1) 256)))))))) [2018-12-23 14:38:31,299 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_29, v_subst_4, v_prenex_28, main_yold, v_subst_5]. (let ((.cse4 (select main_a main_y))) (or (let ((.cse6 (+ v_subst_4 1))) (let ((.cse7 (mod .cse6 256))) (let ((.cse5 (mod (+ .cse7 1) 256))) (let ((.cse3 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse1 (select main_a .cse5)) (.cse0 (select main_a .cse7)) (.cse2 (select main_a v_subst_4))) (and (= .cse0 .cse1) (= 1000 .cse2) (= (mod (+ .cse3 1) 256) main_y) (= .cse4 (select main_a v_prenex_29)) (= (select main_a .cse3) .cse1) (= .cse0 .cse2) (= main_x (mod (+ .cse5 1) 256)) (= 0 (select main_a .cse6))))))) (let ((.cse12 (mod (+ v_prenex_28 1) 256))) (let ((.cse9 (select main_a .cse12)) (.cse11 (select main_a v_prenex_28)) (.cse8 (select main_a (+ v_prenex_28 (- 1)))) (.cse10 (mod (+ .cse12 1) 256))) (and (= .cse8 1000) (= .cse9 (select main_a .cse10)) (= .cse9 .cse4) (= .cse11 .cse9) (= .cse11 .cse8) (= main_y (mod (+ .cse10 1) 256)) (= main_x .cse10) (= v_prenex_28 (mod v_prenex_28 256))))) (let ((.cse17 (mod (+ v_subst_5 1) 256))) (let ((.cse14 (select main_a .cse17)) (.cse16 (select main_a v_subst_5)) (.cse13 (select main_a (+ v_subst_5 (- 1)))) (.cse15 (mod (+ .cse17 1) 256))) (and (= .cse13 1000) (= .cse14 (select main_a .cse15)) (= .cse16 .cse14) (= .cse16 .cse13) (= main_y (mod (+ .cse15 1) 256)) (= .cse4 (select main_a main_yold)) (= main_x .cse15) (= v_subst_5 (mod v_subst_5 256))))))) [2018-12-23 14:38:46,296 WARN L181 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-12-23 14:38:47,432 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 87 [2018-12-23 14:38:47,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,580 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:38:47,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,670 INFO L303 Elim1Store]: Index analysis took 229 ms [2018-12-23 14:38:47,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 365 [2018-12-23 14:38:47,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:47,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 342 [2018-12-23 14:38:47,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:48,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:48,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,580 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:38:48,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,839 INFO L303 Elim1Store]: Index analysis took 657 ms [2018-12-23 14:38:48,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 358 [2018-12-23 14:38:48,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:48,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:49,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:49,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:49,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:49,036 INFO L303 Elim1Store]: Index analysis took 153 ms [2018-12-23 14:38:49,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 341 [2018-12-23 14:38:49,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:49,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:57,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 216 [2018-12-23 14:38:57,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 207 [2018-12-23 14:38:57,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:57,393 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:57,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 209 [2018-12-23 14:38:57,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:38:57,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 206 [2018-12-23 14:38:57,630 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-23 14:38:57,763 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:38:58,318 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. [2018-12-23 14:38:58,319 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:267, output treesize:367 [2018-12-23 14:39:00,465 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:39:00,466 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_31, v_subst_4, main_yold, v_main_a_32, v_subst_5]. (or (let ((.cse3 (+ v_subst_4 1))) (let ((.cse8 (mod .cse3 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse0 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse1 (select v_prenex_31 v_subst_4)) (.cse6 (mod (+ .cse7 1) 256)) (.cse4 (select v_prenex_31 .cse8)) (.cse2 (select v_prenex_31 .cse7))) (and (= main_y (mod (+ (mod (+ .cse0 1) 256) 1) 256)) (= .cse1 1000) (= (select v_prenex_31 .cse0) .cse2) (= (select v_prenex_31 .cse3) 0) (= .cse1 .cse4) (= (let ((.cse5 (store v_prenex_31 main_x (select v_prenex_31 .cse6)))) (store .cse5 main_y (select .cse5 main_yold))) main_a) (= (mod (+ .cse6 1) 256) main_x) (= .cse4 .cse2)))))) (let ((.cse16 (mod (+ v_subst_5 1) 256))) (let ((.cse15 (mod (+ .cse16 1) 256))) (let ((.cse10 (select v_main_a_32 .cse16)) (.cse9 (select v_main_a_32 v_subst_5)) (.cse13 (select v_main_a_32 (+ v_subst_5 (- 1)))) (.cse11 (select v_main_a_32 .cse15)) (.cse12 (mod (+ .cse15 1) 256))) (and (= .cse9 .cse10) (= .cse11 .cse10) (= main_x .cse12) (= .cse9 .cse13) (= 1000 .cse13) (= (let ((.cse14 (store v_main_a_32 main_x .cse11))) (store .cse14 main_y (select .cse14 main_yold))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse12 1) 256))))))) [2018-12-23 14:39:00,466 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_prenex_32, v_prenex_33, v_subst_4, main_yold]. (let ((.cse6 (select main_a main_y)) (.cse5 (select main_a main_x))) (or (let ((.cse8 (mod (+ v_prenex_33 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse0 (select main_a .cse8)) (.cse3 (select main_a v_prenex_33)) (.cse2 (select main_a (+ v_prenex_33 (- 1)))) (.cse1 (select main_a .cse7)) (.cse4 (mod (+ .cse7 1) 256))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse3 .cse0) (= .cse3 .cse2) (= main_x .cse4) (= .cse1 .cse5) (= .cse1 .cse6) (= v_prenex_33 (mod v_prenex_33 256)) (= main_y (mod (+ .cse4 1) 256)))))) (let ((.cse15 (mod (+ v_subst_5 1) 256))) (let ((.cse14 (mod (+ .cse15 1) 256))) (let ((.cse9 (select main_a .cse15)) (.cse12 (select main_a v_subst_5)) (.cse11 (select main_a (+ v_subst_5 (- 1)))) (.cse10 (select main_a .cse14)) (.cse13 (mod (+ .cse14 1) 256))) (and (= .cse9 .cse10) (= .cse11 1000) (= .cse12 .cse9) (= .cse12 .cse11) (= main_x .cse13) (= .cse10 .cse5) (= .cse6 (select main_a v_prenex_32)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse13 1) 256)))))) (let ((.cse22 (+ v_subst_4 1))) (let ((.cse23 (mod .cse22 256))) (let ((.cse21 (mod (+ .cse23 1) 256)) (.cse24 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse16 (mod (+ (mod (+ .cse24 1) 256) 1) 256)) (.cse18 (select main_a .cse21)) (.cse20 (select main_a .cse24)) (.cse17 (select main_a .cse23)) (.cse19 (select main_a v_subst_4))) (and (= main_y .cse16) (= .cse17 .cse18) (= 1000 .cse19) (= (select main_a .cse16) (select main_a main_yold)) (= .cse20 .cse18) (= .cse5 .cse20) (= (mod (+ (mod (+ .cse21 1) 256) 1) 256) main_x) (= .cse17 .cse19) (= 0 (select main_a .cse22))))))))) [2018-12-23 14:39:15,187 WARN L181 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-12-23 14:39:17,810 WARN L181 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 100 [2018-12-23 14:39:17,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:17,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 342 [2018-12-23 14:39:18,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:18,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:18,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:18,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:18,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:18,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:18,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:18,571 INFO L303 Elim1Store]: Index analysis took 168 ms [2018-12-23 14:39:18,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 347 [2018-12-23 14:39:18,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:39:18,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:39:19,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 353 [2018-12-23 14:39:19,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:19,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 352 [2018-12-23 14:39:19,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:39:19,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:39:29,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,755 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:39:29,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:29,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:30,735 INFO L303 Elim1Store]: Index analysis took 1106 ms [2018-12-23 14:39:30,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 199 treesize of output 683 [2018-12-23 14:39:31,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:31,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:31,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:31,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:31,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:31,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:31,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:31,861 INFO L303 Elim1Store]: Index analysis took 899 ms [2018-12-23 14:39:31,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 655 treesize of output 759 [2018-12-23 14:39:31,878 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:39:33,999 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:39:34,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,143 INFO L683 Elim1Store]: detected equality via solver [2018-12-23 14:39:34,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:34,767 INFO L303 Elim1Store]: Index analysis took 757 ms [2018-12-23 14:39:34,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 214 treesize of output 678 [2018-12-23 14:39:35,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:35,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:35,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:35,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:35,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:35,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:35,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:35,115 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-12-23 14:39:35,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 669 treesize of output 770 [2018-12-23 14:39:35,125 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-23 14:39:38,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:38,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:39,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:40,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:40,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:40,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:40,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:39:40,153 INFO L303 Elim1Store]: Index analysis took 2135 ms [2018-12-23 14:39:40,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 740 [2018-12-23 14:39:40,161 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-23 14:39:41,676 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:39:42,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-23 14:39:42,326 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:380, output treesize:353 [2018-12-23 14:39:44,453 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:39:44,454 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_33, v_subst_4, main_yold, v_prenex_34, v_prenex_36, v_subst_5]. (or (let ((.cse2 (+ v_subst_4 1))) (let ((.cse9 (mod .cse2 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse6 (mod (+ (mod (+ .cse10 1) 256) 1) 256))) (let ((.cse0 (select v_main_a_33 .cse6)) (.cse1 (select v_main_a_33 .cse11)) (.cse4 (select v_main_a_33 v_subst_4)) (.cse5 (mod (+ (mod (+ .cse11 1) 256) 1) 256)) (.cse7 (select v_main_a_33 .cse10)) (.cse8 (select v_main_a_33 .cse9))) (and (= .cse0 .cse1) (= (select v_main_a_33 .cse2) 0) (= (let ((.cse3 (store v_main_a_33 main_x .cse0))) (store .cse3 main_y (select .cse3 main_yold))) main_a) (= .cse4 1000) (= (select v_main_a_33 .cse5) (select v_main_a_33 v_prenex_34)) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse1) (= .cse4 .cse8) (= main_y (mod (+ .cse5 1) 256)) (= .cse7 .cse8))))))) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse13 (select v_prenex_36 .cse21)) (.cse15 (select v_prenex_36 v_subst_5)) (.cse14 (mod (+ .cse21 1) 256)) (.cse17 (select v_prenex_36 .cse20)) (.cse18 (select v_prenex_36 .cse19)) (.cse16 (select v_prenex_36 (+ v_subst_5 (- 1))))) (and (= main_a (let ((.cse12 (store v_prenex_36 main_x .cse13))) (store .cse12 main_y (select .cse12 main_yold)))) (= main_x .cse14) (= .cse15 .cse16) (= .cse17 .cse13) (= .cse15 .cse18) (= main_y (mod (+ .cse14 1) 256)) (= .cse17 .cse18) (= v_subst_5 (mod v_subst_5 256)) (= .cse16 1000))))))) [2018-12-23 14:39:44,454 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, main_yold, v_subst_5, v_prenex_39]. (or (let ((.cse7 (+ v_subst_4 1))) (let ((.cse9 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse8 (mod .cse7 256))) (let ((.cse10 (mod (+ .cse8 1) 256)) (.cse5 (mod (+ (mod (+ .cse9 1) 256) 1) 256))) (let ((.cse3 (mod (+ .cse5 1) 256)) (.cse1 (select main_a .cse10)) (.cse4 (select main_a (mod (+ (mod (+ .cse10 1) 256) 1) 256))) (.cse6 (select main_a .cse9)) (.cse0 (select main_a .cse8)) (.cse2 (select main_a v_subst_4))) (and (= .cse0 .cse1) (= 1000 .cse2) (= (select main_a .cse3) (select main_a main_yold)) (= main_y .cse3) (= .cse4 (select main_a .cse5)) (= .cse6 .cse1) (= .cse4 .cse6) (= .cse0 .cse2) (= main_x .cse5) (= 0 (select main_a .cse7))))))) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse11 (select main_a .cse19)) (.cse14 (select main_a v_subst_5)) (.cse13 (select main_a (+ v_subst_5 (- 1)))) (.cse16 (select main_a .cse17)) (.cse12 (select main_a .cse18)) (.cse15 (mod (+ .cse17 1) 256))) (and (= .cse11 .cse12) (= .cse13 1000) (= .cse14 .cse11) (= main_x .cse15) (= .cse14 .cse13) (= .cse16 (select main_a main_x)) (= .cse16 .cse12) (= main_y (mod (+ .cse15 1) 256)) (= (select main_a main_y) (select main_a v_prenex_39)) (= v_subst_5 (mod v_subst_5 256)))))))) [2018-12-23 14:40:08,980 WARN L181 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-12-23 14:40:18,799 WARN L181 SmtUtils]: Spent 9.66 s on a formula simplification that was a NOOP. DAG size: 106 [2018-12-23 14:40:18,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:19,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:20,853 INFO L303 Elim1Store]: Index analysis took 2018 ms [2018-12-23 14:40:20,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 3 new quantified variables, introduced 17 case distinctions, treesize of input 246 treesize of output 941 [2018-12-23 14:40:21,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:21,433 INFO L303 Elim1Store]: Index analysis took 373 ms [2018-12-23 14:40:21,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 909 treesize of output 1017 [2018-12-23 14:40:21,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:40:24,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:40:24,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:25,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:26,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:26,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:26,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:26,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:26,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:26,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:26,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:27,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:27,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:27,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:27,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:27,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:27,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:28,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:29,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:29,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:29,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:29,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:29,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:29,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,284 INFO L303 Elim1Store]: Index analysis took 7464 ms [2018-12-23 14:40:32,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 261 treesize of output 932 [2018-12-23 14:40:32,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:40:32,662 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-12-23 14:40:32,663 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 900 treesize of output 1005 [2018-12-23 14:40:32,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:40:36,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:41:10,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,208 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-12-23 14:41:10,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 550 [2018-12-23 14:41:10,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 561 [2018-12-23 14:41:10,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:41:10,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:41:10,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,880 INFO L303 Elim1Store]: Index analysis took 178 ms [2018-12-23 14:41:10,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 197 treesize of output 535 [2018-12-23 14:41:10,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:10,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:41:11,028 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-12-23 14:41:11,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 552 [2018-12-23 14:41:11,043 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-23 14:41:11,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:41:17,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-23 14:41:17,572 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:478, output treesize:641 [2018-12-23 14:41:19,694 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:41:19,695 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_34, v_subst_4, main_yold, v_prenex_40, v_prenex_41, v_subst_5]. (or (let ((.cse8 (+ v_subst_4 1))) (let ((.cse10 (mod .cse8 256)) (.cse12 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse9 (mod (+ (mod (+ .cse12 1) 256) 1) 256)) (.cse11 (mod (+ .cse10 1) 256))) (let ((.cse0 (select v_main_a_34 (mod (+ (mod (+ .cse11 1) 256) 1) 256))) (.cse2 (select v_main_a_34 v_subst_4)) (.cse1 (select v_main_a_34 .cse12)) (.cse3 (select v_main_a_34 .cse9)) (.cse6 (select v_main_a_34 .cse11)) (.cse4 (select v_main_a_34 .cse10)) (.cse5 (mod (+ .cse9 1) 256))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse0 .cse3) (= .cse2 .cse4) (= (select v_main_a_34 .cse5) (select v_main_a_34 v_prenex_40)) (= .cse6 .cse1) (= (let ((.cse7 (store v_main_a_34 main_x .cse3))) (store .cse7 main_y (select .cse7 main_yold))) main_a) (= 0 (select v_main_a_34 .cse8)) (= .cse6 .cse4) (= main_x .cse5) (= main_y (mod (+ .cse5 1) 256))))))) (let ((.cse24 (mod (+ v_subst_5 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse22 1) 256))) (let ((.cse16 (mod (+ .cse21 1) 256)) (.cse14 (select v_prenex_41 v_subst_5)) (.cse13 (select v_prenex_41 (+ v_subst_5 (- 1)))) (.cse15 (select v_prenex_41 .cse24)) (.cse17 (select v_prenex_41 .cse23)) (.cse19 (select v_prenex_41 .cse22)) (.cse18 (select v_prenex_41 .cse21))) (and (= .cse13 1000) (= .cse14 .cse15) (= main_x .cse16) (= main_y (mod (+ .cse16 1) 256)) (= .cse14 .cse13) (= .cse15 .cse17) (= .cse18 .cse19) (= v_subst_5 (mod v_subst_5 256)) (= .cse17 .cse19) (= (let ((.cse20 (store v_prenex_41 main_x .cse18))) (store .cse20 main_y (select .cse20 main_yold))) main_a)))))))) [2018-12-23 14:41:19,695 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_45, main_yold, v_subst_5, v_prenex_46, v_subst_4]. (let ((.cse3 (select main_a main_x)) (.cse8 (select main_a main_y))) (or (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse9 (mod (+ .cse12 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse0 (select main_a .cse12)) (.cse6 (select main_a v_subst_5)) (.cse2 (select main_a (+ v_subst_5 (- 1)))) (.cse7 (mod (+ .cse11 1) 256)) (.cse4 (select main_a .cse11)) (.cse5 (select main_a .cse10)) (.cse1 (select main_a .cse9))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse3 .cse4) (= .cse5 .cse4) (= .cse6 .cse0) (= .cse6 .cse2) (= main_x .cse7) (= main_y (mod (+ .cse7 1) 256)) (= .cse8 .cse4) (= .cse5 .cse1) (= v_subst_5 (mod v_subst_5 256)))))))) (let ((.cse23 (mod (+ v_prenex_45 1) 256))) (let ((.cse20 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse22 (mod (+ .cse21 1) 256))) (let ((.cse16 (select main_a .cse22)) (.cse14 (select main_a .cse23)) (.cse18 (select main_a v_prenex_45)) (.cse13 (select main_a (+ v_prenex_45 (- 1)))) (.cse19 (mod (+ .cse22 1) 256)) (.cse17 (select main_a .cse21)) (.cse15 (select main_a .cse20))) (and (= .cse13 1000) (= .cse14 .cse15) (= .cse3 .cse16) (= .cse17 .cse16) (= .cse18 .cse14) (= .cse18 .cse13) (= main_x .cse19) (= main_y (mod (+ .cse19 1) 256)) (= .cse17 .cse15) (= .cse8 (select main_a main_yold)) (= v_prenex_45 (mod v_prenex_45 256)))))))) (let ((.cse31 (+ v_subst_4 1))) (let ((.cse33 (mod .cse31 256)) (.cse34 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse32 (mod (+ (mod (+ .cse34 1) 256) 1) 256)) (.cse35 (mod (+ .cse33 1) 256))) (let ((.cse25 (select main_a .cse35)) (.cse27 (select main_a (mod (+ (mod (+ .cse35 1) 256) 1) 256))) (.cse29 (select main_a .cse34)) (.cse28 (select main_a .cse32)) (.cse24 (select main_a .cse33)) (.cse26 (select main_a v_subst_4)) (.cse30 (mod (+ .cse32 1) 256))) (and (= .cse24 .cse25) (= 1000 .cse26) (= .cse27 .cse28) (= .cse8 (select main_a v_prenex_46)) (= .cse29 .cse25) (= .cse27 .cse29) (= (select main_a .cse30) .cse28) (= main_x .cse30) (= .cse24 .cse26) (= main_y (mod (+ .cse30 1) 256)) (= 0 (select main_a .cse31))))))))) [2018-12-23 14:41:55,019 WARN L181 SmtUtils]: Spent 12.17 s on a formula simplification. DAG size of input: 130 DAG size of output: 85 [2018-12-23 14:42:24,358 WARN L181 SmtUtils]: Spent 29.24 s on a formula simplification that was a NOOP. DAG size: 107 [2018-12-23 14:42:24,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:24,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:24,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:25,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:25,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:25,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:25,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:25,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:25,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:25,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:26,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:27,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:27,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:27,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:28,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:28,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:28,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:28,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:28,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:28,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:29,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:29,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:29,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:29,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:29,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:29,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:30,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:30,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:30,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:30,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:30,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:30,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,388 INFO L303 Elim1Store]: Index analysis took 7011 ms [2018-12-23 14:42:31,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 271 treesize of output 1023 [2018-12-23 14:42:31,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:31,845 INFO L303 Elim1Store]: Index analysis took 382 ms [2018-12-23 14:42:31,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 48 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 256 treesize of output 1360 [2018-12-23 14:42:31,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-23 14:42:38,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:42:39,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:39,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:39,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:39,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:39,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:41,988 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (let ((.cse0 (mod (+ v_subst_4 1) 256))) (= (mod (+ (mod (+ (mod (+ .cse0 1) 256) 1) 256) 1) 256) .cse0)) [2018-12-23 14:42:41,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:42,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:42,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:42,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:42,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:43,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:43,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:43,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:43,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:43,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:44,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:44,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:44,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:44,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:44,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:44,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:45,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:45,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:45,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:45,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:45,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:46,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:47,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:47,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:47,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:47,826 INFO L303 Elim1Store]: Index analysis took 9222 ms [2018-12-23 14:42:47,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 1042 [2018-12-23 14:42:48,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:42:48,108 INFO L303 Elim1Store]: Index analysis took 203 ms [2018-12-23 14:42:48,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 47 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 1373 [2018-12-23 14:42:48,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-23 14:42:54,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:43:46,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,281 INFO L303 Elim1Store]: Index analysis took 213 ms [2018-12-23 14:43:46,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 816 [2018-12-23 14:43:46,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:46,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 1098 [2018-12-23 14:43:46,413 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-23 14:43:47,051 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:43:47,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,467 INFO L303 Elim1Store]: Index analysis took 400 ms [2018-12-23 14:43:47,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 249 treesize of output 797 [2018-12-23 14:43:47,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:43:47,648 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-12-23 14:43:47,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 215 treesize of output 1085 [2018-12-23 14:43:47,667 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-23 14:43:48,341 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:43:54,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-23 14:43:54,727 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:563, output treesize:515 [2018-12-23 14:43:56,855 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:43:56,856 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_prenex_45, main_yold, v_prenex_47, v_subst_4]. (or (let ((.cse13 (mod (+ v_prenex_45 1) 256))) (let ((.cse11 (mod (+ .cse13 1) 256))) (let ((.cse10 (mod (+ .cse11 1) 256))) (let ((.cse12 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse12 1) 256))) (let ((.cse1 (select v_main_a_35 .cse13)) (.cse3 (select v_main_a_35 .cse12)) (.cse7 (select v_main_a_35 .cse9)) (.cse2 (select v_main_a_35 .cse11)) (.cse4 (select v_main_a_35 .cse10)) (.cse6 (mod (+ .cse9 1) 256)) (.cse0 (select v_main_a_35 v_prenex_45)) (.cse8 (select v_main_a_35 (+ v_prenex_45 (- 1))))) (and (= .cse0 .cse1) (= v_prenex_45 (mod v_prenex_45 256)) (= .cse2 .cse1) (= .cse3 .cse4) (= (let ((.cse5 (store v_main_a_35 main_x .cse7))) (store .cse5 (mod (+ .cse6 1) 256) (select .cse5 main_yold))) main_a) (= 1000 .cse8) (= .cse3 .cse7) (= .cse2 .cse4) (= main_x .cse6) (= .cse0 .cse8)))))))) (let ((.cse18 (+ v_subst_4 1)) (.cse25 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse27 (mod (+ (mod (+ .cse25 1) 256) 1) 256)) (.cse26 (mod .cse18 256))) (let ((.cse24 (mod (+ .cse26 1) 256)) (.cse28 (mod (+ .cse27 1) 256))) (let ((.cse16 (mod (+ .cse28 1) 256)) (.cse14 (select v_prenex_47 .cse28)) (.cse17 (select v_prenex_47 v_subst_4)) (.cse15 (select v_prenex_47 .cse27)) (.cse21 (select v_prenex_47 (mod (+ (mod (+ .cse24 1) 256) 1) 256))) (.cse20 (select v_prenex_47 .cse26)) (.cse22 (select v_prenex_47 .cse25)) (.cse23 (select v_prenex_47 .cse24))) (and (= .cse14 .cse15) (= main_x .cse16) (= .cse17 1000) (= (select v_prenex_47 .cse18) 0) (= (let ((.cse19 (store v_prenex_47 main_x .cse14))) (store .cse19 (mod (+ .cse16 1) 256) (select .cse19 main_yold))) main_a) (= .cse17 .cse20) (= .cse21 .cse15) (= .cse22 .cse21) (= .cse23 .cse20) (= .cse22 .cse23))))))) [2018-12-23 14:43:56,856 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_49, v_prenex_45, v_subst_4, main_yold]. (let ((.cse8 (select main_a main_x))) (or (let ((.cse12 (mod (+ v_prenex_45 1) 256))) (let ((.cse13 (mod (+ .cse12 1) 256))) (let ((.cse9 (mod (+ .cse13 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse5 (select main_a v_prenex_45)) (.cse1 (select main_a .cse11)) (.cse2 (select main_a .cse13)) (.cse6 (select main_a .cse12)) (.cse4 (mod (+ .cse11 1) 256)) (.cse7 (select main_a (+ v_prenex_45 (- 1)))) (.cse0 (select main_a .cse10)) (.cse3 (select main_a .cse9))) (and (= .cse0 .cse1) (= v_prenex_45 (mod v_prenex_45 256)) (= .cse2 .cse3) (= (select main_a v_prenex_49) (select main_a (mod (+ .cse4 1) 256))) (= .cse5 .cse6) (= .cse5 .cse7) (= .cse8 .cse1) (= .cse2 .cse6) (= main_x .cse4) (= .cse7 1000) (= .cse0 .cse3)))))))) (let ((.cse22 (+ v_subst_4 1)) (.cse26 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse25 (mod (+ (mod (+ .cse26 1) 256) 1) 256)) (.cse23 (mod .cse22 256))) (let ((.cse27 (mod (+ .cse23 1) 256)) (.cse24 (mod (+ .cse25 1) 256))) (let ((.cse17 (mod (+ .cse24 1) 256)) (.cse15 (select main_a .cse27)) (.cse18 (select main_a (mod (+ (mod (+ .cse27 1) 256) 1) 256))) (.cse20 (select main_a .cse26)) (.cse19 (select main_a .cse25)) (.cse21 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse16 (select main_a v_subst_4))) (and (= .cse14 .cse15) (= 1000 .cse16) (= main_x .cse17) (= (select main_a (mod (+ .cse17 1) 256)) (select main_a main_yold)) (= .cse18 .cse19) (= .cse20 .cse15) (= .cse18 .cse20) (= .cse21 .cse19) (= .cse8 .cse21) (= .cse14 .cse16) (= 0 (select main_a .cse22))))))))) [2018-12-23 14:44:26,457 WARN L181 SmtUtils]: Spent 4.53 s on a formula simplification that was a NOOP. DAG size: 97 [2018-12-23 14:44:26,500 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {317#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-23 14:44:27,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {321#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is VALID [2018-12-23 14:44:29,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {321#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {325#(or (exists ((main_xold Int) (main_yold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))) (exists ((v_subst_4 Int) (v_prenex_20 Int)) (and (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a v_prenex_20)) (= 1000 (select main_a v_subst_4)) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} is UNKNOWN [2018-12-23 14:44:31,715 INFO L273 TraceCheckUtils]: 3: Hoare triple {325#(or (exists ((main_xold Int) (main_yold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))) (exists ((v_subst_4 Int) (v_prenex_20 Int)) (and (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a v_prenex_20)) (= 1000 (select main_a v_subst_4)) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {329#(or (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} is UNKNOWN [2018-12-23 14:44:33,751 INFO L273 TraceCheckUtils]: 4: Hoare triple {329#(or (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {333#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))))} is UNKNOWN [2018-12-23 14:44:35,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {337#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} is UNKNOWN [2018-12-23 14:44:37,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {341#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_45 Int)) (and (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ v_prenex_45 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))))))} is UNKNOWN [2018-12-23 14:44:39,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {341#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_45 Int)) (and (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ v_prenex_45 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {345#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_49 Int) (v_prenex_45 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_49) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))))))} is UNKNOWN [2018-12-23 14:44:39,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {345#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_49 Int) (v_prenex_45 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_49) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))))))} assume a[x] == 0; {308#false} is VALID [2018-12-23 14:44:39,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(a[y] == 1000); {308#false} is VALID [2018-12-23 14:44:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 11 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:44:39,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:45:13,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(a[y] == 1000); {308#false} is VALID [2018-12-23 14:45:13,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#(not (= (select main_a main_x) 0))} assume a[x] == 0; {308#false} is VALID [2018-12-23 14:45:13,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {355#(not (= (select main_a main_x) 0))} is VALID [2018-12-23 14:45:13,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-23 14:45:13,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-23 14:45:13,606 INFO L273 TraceCheckUtils]: 4: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-23 14:45:13,612 INFO L273 TraceCheckUtils]: 3: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-23 14:45:13,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-23 14:45:13,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-23 14:45:13,625 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-23 14:45:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-23 14:45:13,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:45:13,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 3] total 16 [2018-12-23 14:45:13,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:45:13,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2018-12-23 14:45:13,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:45:13,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-12-23 14:45:27,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 11 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-12-23 14:45:27,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-23 14:45:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-23 14:45:27,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=173, Unknown=36, NotChecked=0, Total=272 [2018-12-23 14:45:27,918 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 15 states. [2018-12-23 14:46:52,228 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-12-23 14:47:30,004 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-23 14:48:17,728 WARN L181 SmtUtils]: Spent 5.88 s on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-12-23 14:49:15,155 WARN L181 SmtUtils]: Spent 12.18 s on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-12-23 14:50:02,235 WARN L181 SmtUtils]: Spent 15.98 s on a formula simplification. DAG size of input: 91 DAG size of output: 88