java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 14:18:04,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 14:18:04,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 14:18:04,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 14:18:04,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 14:18:04,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 14:18:04,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 14:18:04,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 14:18:04,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 14:18:04,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 14:18:04,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 14:18:04,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 14:18:04,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 14:18:04,962 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 14:18:04,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 14:18:04,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 14:18:04,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 14:18:04,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 14:18:04,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 14:18:04,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 14:18:04,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 14:18:04,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 14:18:04,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 14:18:04,975 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 14:18:04,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 14:18:04,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 14:18:04,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 14:18:04,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 14:18:04,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 14:18:04,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 14:18:04,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 14:18:04,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 14:18:04,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 14:18:04,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 14:18:04,983 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 14:18:04,984 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 14:18:04,984 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-18 14:18:05,010 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 14:18:05,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 14:18:05,012 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 14:18:05,012 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 14:18:05,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 14:18:05,012 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 14:18:05,012 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 14:18:05,013 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 14:18:05,013 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 14:18:05,013 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 14:18:05,013 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 14:18:05,013 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 14:18:05,013 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 14:18:05,014 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 14:18:05,014 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 14:18:05,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 14:18:05,015 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 14:18:05,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 14:18:05,015 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 14:18:05,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 14:18:05,015 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 14:18:05,016 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 14:18:05,016 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 14:18:05,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 14:18:05,017 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 14:18:05,017 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 14:18:05,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 14:18:05,017 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 14:18:05,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 14:18:05,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 14:18:05,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 14:18:05,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:18:05,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 14:18:05,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 14:18:05,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 14:18:05,022 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 14:18:05,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 14:18:05,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 14:18:05,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 14:18:05,023 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 14:18:05,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 14:18:05,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 14:18:05,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 14:18:05,070 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 14:18:05,071 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 14:18:05,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2019-01-18 14:18:05,072 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-01-18 14:18:05,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 14:18:05,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 14:18:05,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 14:18:05,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 14:18:05,112 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 14:18:05,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,147 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-18 14:18:05,147 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-18 14:18:05,147 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-18 14:18:05,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 14:18:05,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 14:18:05,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 14:18:05,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 14:18:05,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... [2019-01-18 14:18:05,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 14:18:05,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 14:18:05,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 14:18:05,179 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 14:18:05,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:18:05,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-18 14:18:05,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-18 14:18:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-18 14:18:05,463 INFO L278 CfgBuilder]: Using library mode [2019-01-18 14:18:05,463 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-18 14:18:05,464 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:18:05 BoogieIcfgContainer [2019-01-18 14:18:05,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 14:18:05,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 14:18:05,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 14:18:05,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 14:18:05,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:18:05" (1/2) ... [2019-01-18 14:18:05,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf181f6 and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:18:05, skipping insertion in model container [2019-01-18 14:18:05,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:18:05" (2/2) ... [2019-01-18 14:18:05,472 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-01-18 14:18:05,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 14:18:05,489 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 14:18:05,506 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 14:18:05,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 14:18:05,534 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 14:18:05,534 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 14:18:05,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 14:18:05,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 14:18:05,534 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 14:18:05,535 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 14:18:05,535 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 14:18:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 14:18:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:18:05,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:18:05,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:18:05,558 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:18:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:18:05,564 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-01-18 14:18:05,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:18:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:05,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:18:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:05,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:18:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:18:06,076 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} is VALID [2019-01-18 14:18:06,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} assume a[x] == 0; {12#(= (select main_a main_y) 1000)} is VALID [2019-01-18 14:18:06,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-01-18 14:18:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:18:06,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:18:06,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 14:18:06,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:18:06,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 14:18:06,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:18:06,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-18 14:18:06,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:18:06,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 14:18:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 14:18:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 14:18:06,127 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-18 14:18:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:06,356 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-18 14:18:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 14:18:06,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 14:18:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:18:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:18:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-18 14:18:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:18:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-18 14:18:06,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-01-18 14:18:06,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:18:06,447 INFO L225 Difference]: With dead ends: 15 [2019-01-18 14:18:06,448 INFO L226 Difference]: Without dead ends: 5 [2019-01-18 14:18:06,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 14:18:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-18 14:18:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-18 14:18:06,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:18:06,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-18 14:18:06,554 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-18 14:18:06,554 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-18 14:18:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:06,555 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-18 14:18:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:18:06,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:18:06,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:18:06,557 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-18 14:18:06,557 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-18 14:18:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:06,560 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-18 14:18:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:18:06,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:18:06,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:18:06,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:18:06,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:18:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-18 14:18:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-18 14:18:06,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-18 14:18:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:18:06,566 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-18 14:18:06,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 14:18:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:18:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:18:06,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:18:06,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:18:06,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:18:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:18:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-01-18 14:18:06,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:18:06,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:06,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:18:06,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:06,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:18:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:18:06,841 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} is VALID [2019-01-18 14:18:06,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {52#(= (select main_a main_x) 1000)} is VALID [2019-01-18 14:18:06,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-01-18 14:18:06,865 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-18 14:18:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:18:06,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:18:06,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:18:06,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:18:06,869 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-01-18 14:18:06,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:18:06,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:18:07,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:18:07,068 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 22 root evaluator evaluations with a maximum evaluation depth of 3. Performed 22 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:18:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:18:07,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:18:07,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:18:07,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:18:07,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:18:07,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:18:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:18:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:18:07,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:18:07,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:18:07,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:07,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:07,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:18:07,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:07,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:07,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:07,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:18:07,367 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:18:07,367 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_11]. (and (= main_a (store (store v_main_a_11 main_x 1000) main_y 0)) (= main_y (+ main_x 1))) [2019-01-18 14:18:07,367 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:18:07,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:07,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:07,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:07,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2019-01-18 14:18:07,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:07,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,067 INFO L303 Elim1Store]: Index analysis took 169 ms [2019-01-18 14:18:08,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 70 [2019-01-18 14:18:08,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:08,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 90 [2019-01-18 14:18:08,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:08,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:18:08,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 57 [2019-01-18 14:18:08,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2019-01-18 14:18:08,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:08,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:08,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 86 [2019-01-18 14:18:08,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:08,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:18:08,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-18 14:18:08,697 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2019-01-18 14:18:10,891 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:18:10,891 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_12, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse2 (select v_main_a_12 main_xold))) (and (= (select v_main_a_12 .cse0) 0) (= main_x (mod .cse0 256)) (= (let ((.cse1 (store v_main_a_12 main_x .cse2))) (store .cse1 (mod (+ main_xold 2) 256) (select .cse1 main_yold))) main_a) (= .cse2 1000))) [2019-01-18 14:18:10,892 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4, v_prenex_3]. (let ((.cse6 (select main_a main_x)) (.cse1 (select main_a (+ main_x (- 1))))) (let ((.cse2 (= main_x (mod main_x 256))) (.cse3 (= 1000 .cse1)) (.cse0 (select main_a (mod (+ main_x 1) 256))) (.cse4 (= .cse6 .cse1))) (or (and (= .cse0 .cse1) .cse2 .cse3 .cse4) (let ((.cse5 (select main_a v_prenex_4)) (.cse7 (+ v_prenex_4 1))) (and (= (select main_a (mod (+ v_prenex_4 2) 256)) .cse5) (= .cse6 .cse5) (= .cse5 1000) (= 0 (select main_a .cse7)) (= main_x (mod .cse7 256)))) (and .cse2 .cse3 (= .cse0 (select main_a v_prenex_3)) .cse4) (let ((.cse8 (select main_a main_xold)) (.cse9 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse6 .cse8) (= 0 (select main_a .cse9)) (= .cse8 1000) (= main_x (mod .cse9 256))))))) [2019-01-18 14:18:11,144 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-01-18 14:18:11,241 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-18 14:18:13,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-01-18 14:18:13,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} assume a[x] == 0; {50#false} is VALID [2019-01-18 14:18:13,265 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-18 14:18:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:18:13,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:18:15,445 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-18 14:18:15,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-01-18 14:18:15,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {70#(not (= (select main_a main_x) 0))} is VALID [2019-01-18 14:18:15,451 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} is VALID [2019-01-18 14:18:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:18:15,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:18:15,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-18 14:18:15,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:18:15,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:18:15,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:18:15,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-18 14:18:17,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-18 14:18:17,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 14:18:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 14:18:17,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:18:17,513 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-18 14:18:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:21,597 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 14:18:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 14:18:21,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:18:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:18:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:18:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-18 14:18:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:18:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-18 14:18:21,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-01-18 14:18:23,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-18 14:18:23,638 INFO L225 Difference]: With dead ends: 8 [2019-01-18 14:18:23,638 INFO L226 Difference]: Without dead ends: 6 [2019-01-18 14:18:23,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:18:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-18 14:18:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-18 14:18:23,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:18:23,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-18 14:18:23,649 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-18 14:18:23,649 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-18 14:18:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:23,650 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-18 14:18:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 14:18:23,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:18:23,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:18:23,651 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-18 14:18:23,651 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-18 14:18:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:23,652 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-18 14:18:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 14:18:23,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:18:23,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:18:23,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:18:23,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:18:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:18:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-18 14:18:23,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-18 14:18:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:18:23,655 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-18 14:18:23,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 14:18:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 14:18:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 14:18:23,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:18:23,656 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 14:18:23,656 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:18:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:18:23,656 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-01-18 14:18:23,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:18:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:23,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:18:23,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:23,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:18:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:18:23,975 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2019-01-18 14:18:23,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} is VALID [2019-01-18 14:18:23,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {113#(= 1000 (select main_a main_x))} is VALID [2019-01-18 14:18:23,982 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2019-01-18 14:18:23,983 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-18 14:18:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:18:23,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:18:23,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:18:23,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 14:18:23,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 14:18:23,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:18:23,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:18:24,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 14:18:24,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 14:18:24,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 14:18:24,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 14:18:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:18:24,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:18:24,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:18:24,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:18:24,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:24,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:24,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:24,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:18:24,079 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:18:24,079 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_14]. (and (= (store (store v_main_a_14 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2019-01-18 14:18:24,079 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:18:24,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 53 [2019-01-18 14:18:24,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 66 [2019-01-18 14:18:24,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:24,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-18 14:18:24,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:24,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:18:24,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 54 [2019-01-18 14:18:24,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2019-01-18 14:18:24,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:24,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:24,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 [2019-01-18 14:18:24,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:24,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 14:18:24,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-18 14:18:24,758 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-01-18 14:18:26,971 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:18:26,971 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_15, main_xold, main_yold]. (let ((.cse0 (select v_main_a_15 main_xold)) (.cse2 (+ main_xold 1))) (and (= 1000 .cse0) (= (let ((.cse1 (store v_main_a_15 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a) (= (select v_main_a_15 .cse2) 0) (= main_x (mod .cse2 256)) (= main_y (mod (+ main_xold 2) 256)))) [2019-01-18 14:18:26,972 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_8, v_prenex_7]. (let ((.cse0 (select main_a main_x)) (.cse10 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse3 (select main_a main_y)) (.cse7 (= main_x (mod main_x 256))) (.cse8 (= 1000 .cse10)) (.cse9 (= .cse0 .cse10))) (or (let ((.cse1 (select main_a v_prenex_8)) (.cse2 (+ v_prenex_8 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_8 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= .cse4 1000) (= 0 (select main_a .cse5)) (= main_x (mod .cse5 256)) (= .cse3 (select main_a main_yold)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 .cse7 (= .cse3 (select main_a v_prenex_7)) .cse8 .cse9) (and .cse6 (= .cse3 .cse10) .cse7 .cse8 .cse9)))) [2019-01-18 14:18:27,260 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-01-18 14:18:27,519 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-18 14:18:27,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 72 [2019-01-18 14:18:27,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 100 [2019-01-18 14:18:27,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:27,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:27,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2019-01-18 14:18:27,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 93 [2019-01-18 14:18:27,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:27,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:27,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:27,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 122 [2019-01-18 14:18:28,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 167 [2019-01-18 14:18:28,069 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:28,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:28,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 125 [2019-01-18 14:18:28,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:18:28,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 164 [2019-01-18 14:18:28,231 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 14:18:28,283 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:18:28,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-18 14:18:28,400 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2019-01-18 14:18:30,632 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:18:30,633 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_16, main_xold, main_yold, v_prenex_9, v_subst_1]. (or (let ((.cse1 (select v_main_a_16 (+ main_xold (- 1)))) (.cse2 (mod (+ main_xold 1) 256)) (.cse0 (select v_main_a_16 main_xold))) (and (= .cse0 .cse1) (= main_xold (mod main_xold 256)) (= 1000 .cse1) (= main_x .cse2) (= (let ((.cse3 (store v_main_a_16 main_x .cse0))) (store .cse3 (mod (+ .cse2 1) 256) (select .cse3 main_yold))) main_a))) (let ((.cse8 (+ v_subst_1 1))) (let ((.cse7 (mod .cse8 256))) (let ((.cse5 (select v_prenex_9 .cse7)) (.cse4 (select v_prenex_9 v_subst_1))) (and (= .cse4 .cse5) (= (let ((.cse6 (store v_prenex_9 main_x .cse5))) (store .cse6 (mod (+ (mod (+ v_subst_1 2) 256) 1) 256) (select .cse6 main_yold))) main_a) (= .cse4 1000) (= main_x (mod (+ .cse7 1) 256)) (= 0 (select v_prenex_9 .cse8))))))) [2019-01-18 14:18:30,633 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1, main_yold, v_prenex_11, main_xold, v_prenex_10]. (let ((.cse4 (select main_a main_x))) (or (let ((.cse3 (+ v_subst_1 1))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (select main_a v_subst_1)) (.cse2 (select main_a .cse0))) (and (= main_x (mod (+ .cse0 1) 256)) (= .cse1 .cse2) (= (select main_a .cse3) 0) (= .cse1 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= .cse4 .cse2))))) (let ((.cse8 (+ v_prenex_11 1))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (select main_a v_prenex_11)) (.cse5 (select main_a .cse6))) (and (= .cse5 (select main_a (mod (+ (mod (+ v_prenex_11 2) 256) 1) 256))) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse5) (= .cse7 1000) (= (select main_a .cse8) 0) (= .cse4 .cse5))))) (let ((.cse9 (select main_a main_xold)) (.cse11 (mod (+ main_xold 1) 256)) (.cse10 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse9 .cse10) (= .cse4 .cse9) (= main_x .cse11) (= (select main_a (mod (+ .cse11 1) 256)) (select main_a v_prenex_10)) (= 1000 .cse10))))) [2019-01-18 14:18:30,905 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-18 14:18:30,939 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-18 14:18:32,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-01-18 14:18:35,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} is UNKNOWN [2019-01-18 14:18:35,034 INFO L273 TraceCheckUtils]: 3: Hoare triple {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} assume a[x] == 0; {110#false} is VALID [2019-01-18 14:18:35,034 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-18 14:18:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:18:35,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:18:37,377 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-18 14:18:37,378 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2019-01-18 14:18:37,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {135#(not (= (select main_a main_x) 0))} is VALID [2019-01-18 14:18:37,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2019-01-18 14:18:37,387 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2019-01-18 14:18:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 14:18:37,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:18:37,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-18 14:18:37,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:18:37,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:18:37,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:18:37,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-18 14:18:41,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-18 14:18:41,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 14:18:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 14:18:41,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 14:18:41,501 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-01-18 14:18:51,049 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-01-18 14:18:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:55,299 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-18 14:18:55,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 14:18:55,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:18:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:18:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:18:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-18 14:18:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:18:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-18 14:18:55,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-01-18 14:18:59,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-18 14:18:59,486 INFO L225 Difference]: With dead ends: 10 [2019-01-18 14:18:59,486 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 14:18:59,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 14:18:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 14:18:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-18 14:18:59,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:18:59,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-18 14:18:59,558 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-18 14:18:59,558 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-18 14:18:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:59,560 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 14:18:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 14:18:59,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:18:59,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:18:59,560 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-18 14:18:59,560 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-18 14:18:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:18:59,561 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 14:18:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 14:18:59,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:18:59,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:18:59,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:18:59,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:18:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:18:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-18 14:18:59,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-18 14:18:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:18:59,563 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-18 14:18:59,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 14:18:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 14:18:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 14:18:59,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:18:59,563 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-18 14:18:59,563 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:18:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:18:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-01-18 14:18:59,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:18:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:59,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 14:18:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:18:59,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:18:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:00,348 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-01-18 14:19:00,440 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2019-01-18 14:19:00,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} is VALID [2019-01-18 14:19:00,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-01-18 14:19:00,459 INFO L273 TraceCheckUtils]: 3: Hoare triple {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} is VALID [2019-01-18 14:19:00,460 INFO L273 TraceCheckUtils]: 4: Hoare triple {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {197#(= (select main_a main_y) 1000)} is VALID [2019-01-18 14:19:00,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#(= (select main_a main_y) 1000)} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2019-01-18 14:19:00,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-18 14:19:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:00,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:00,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:00,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 14:19:00,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 14:19:00,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:00,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:19:00,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 14:19:00,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 14:19:00,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 14:19:00,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 14:19:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:00,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:00,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:19:00,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:19:00,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:00,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:00,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:00,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:19:00,753 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:00,753 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_19]. (and (= main_y (+ main_x 1)) (= (store (store v_main_a_19 main_x 1000) main_y 0) main_a)) [2019-01-18 14:19:00,753 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:19:00,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2019-01-18 14:19:00,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-18 14:19:00,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:00,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:00,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-18 14:19:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:00,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-18 14:19:00,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:00,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:01,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 14:19:01,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-18 14:19:03,082 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:03,082 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_20, main_yold]. (let ((.cse1 (select v_main_a_20 (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= (select v_main_a_20 main_yold) 0) (= (let ((.cse0 (store v_main_a_20 main_x .cse1))) (store .cse0 main_y (select .cse0 main_yold))) main_a) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 1000))) [2019-01-18 14:19:03,083 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2019-01-18 14:19:03,409 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-18 14:19:03,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-18 14:19:03,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-18 14:19:03,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:03,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:03,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,664 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:19:03,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 148 [2019-01-18 14:19:03,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:03,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 136 [2019-01-18 14:19:03,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:03,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:03,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:19:03,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-18 14:19:06,005 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:06,006 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_21, v_subst_2, v_prenex_12, main_xold]. (or (let ((.cse5 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_21 v_subst_2)) (.cse4 (select v_main_a_21 (+ v_subst_2 (- 1)))) (.cse3 (select v_main_a_21 .cse5)) (.cse1 (mod (+ v_subst_2 1) 256))) (and (= 0 .cse0) (= (select v_main_a_21 .cse1) .cse0) (= main_a (let ((.cse2 (store v_main_a_21 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1)))) (= 1000 .cse4) (= .cse4 .cse3) (= main_x (mod (+ .cse5 1) 256)) (= (mod (+ .cse1 1) 256) main_y)))) (let ((.cse8 (select v_prenex_12 main_xold)) (.cse9 (select v_prenex_12 (+ main_xold (- 1)))) (.cse7 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= (let ((.cse6 (store v_prenex_12 main_x .cse8))) (store .cse6 main_y (select .cse6 .cse7))) main_a) (= .cse8 .cse9) (= .cse9 1000) (= main_x .cse7) (= .cse9 (select v_prenex_12 .cse7)) (= main_y (mod (+ .cse7 1) 256))))) [2019-01-18 14:19:06,006 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, main_xold]. (or (let ((.cse3 (mod v_subst_2 256))) (let ((.cse2 (mod (+ v_subst_2 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a .cse3))) (and (= .cse0 1000) (= (select main_a main_y) .cse1) (= 0 (select main_a v_subst_2)) (= (mod (+ .cse2 1) 256) main_y) (= main_x .cse2) (= .cse0 .cse1) (= (select main_a (mod (+ .cse3 1) 256)) .cse1)))) (let ((.cse6 (mod (+ main_xold 1) 256))) (let ((.cse5 (select main_a (+ main_xold (- 1)))) (.cse4 (select main_a main_xold)) (.cse7 (mod (+ .cse6 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse4 .cse5) (= (select main_a main_x) .cse4) (= main_x .cse6) (= main_y .cse7) (= 1000 .cse5) (= .cse4 (select main_a .cse7)))))) [2019-01-18 14:19:07,009 WARN L181 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-18 14:19:07,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 161 [2019-01-18 14:19:07,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:07,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 159 [2019-01-18 14:19:07,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:07,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:08,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,103 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:19:08,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 270 [2019-01-18 14:19:08,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:08,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 192 [2019-01-18 14:19:08,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:08,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:08,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:19:08,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2019-01-18 14:19:10,589 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:10,589 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_22, v_subst_2, v_prenex_13, v_subst_3]. (or (let ((.cse4 (mod v_subst_2 256)) (.cse2 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (mod (+ .cse2 1) 256)) (.cse3 (select v_main_a_22 (+ v_subst_2 (- 1)))) (.cse5 (select v_main_a_22 .cse4))) (and (= (let ((.cse0 (store v_main_a_22 main_x (select v_main_a_22 .cse2)))) (store .cse0 main_y (select .cse0 .cse1))) main_a) (= (select v_main_a_22 v_subst_2) 0) (= 1000 .cse3) (= (mod (+ .cse1 1) 256) main_y) (= (select v_main_a_22 (mod (+ .cse4 1) 256)) .cse5) (= .cse1 main_x) (= (select v_main_a_22 .cse1) .cse5) (= .cse3 .cse5)))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse7 (select v_prenex_13 (+ v_subst_3 (- 1)))) (.cse9 (select v_prenex_13 .cse11)) (.cse10 (select v_prenex_13 v_subst_3)) (.cse6 (mod (+ .cse11 1) 256))) (and (= .cse6 main_x) (= .cse7 1000) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse8 (store v_prenex_13 main_x .cse9))) (store .cse8 main_y (select .cse8 .cse6))) main_a) (= .cse7 .cse10) (= .cse10 .cse9) (= (select v_prenex_13 .cse6) .cse10) (= main_y (mod (+ .cse6 1) 256)))))) [2019-01-18 14:19:10,589 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_3, v_subst_2]. (let ((.cse3 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_3 1) 256))) (let ((.cse0 (mod (+ .cse4 1) 256)) (.cse2 (select main_a .cse4)) (.cse1 (select main_a v_subst_3))) (and (= .cse0 main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= .cse1 .cse2) (= main_y (mod (+ .cse0 1) 256)) (= .cse3 .cse2) (= (select main_a .cse0) .cse2) (= .cse1 1000)))) (let ((.cse9 (mod v_subst_2 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse5 (select main_a (+ v_subst_2 (- 1)))) (.cse7 (select main_a (mod (+ .cse9 1) 256))) (.cse8 (select main_a .cse9))) (and (= .cse5 1000) (= (mod (+ .cse6 1) 256) main_y) (= .cse7 .cse3) (= .cse6 main_x) (= .cse7 (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= .cse5 .cse8) (= .cse7 .cse8)))))) [2019-01-18 14:19:10,878 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-18 14:19:13,334 WARN L181 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-01-18 14:19:13,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 296 [2019-01-18 14:19:13,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:13,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 212 [2019-01-18 14:19:13,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:13,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:15,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,643 INFO L303 Elim1Store]: Index analysis took 363 ms [2019-01-18 14:19:15,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 394 [2019-01-18 14:19:15,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:15,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 319 [2019-01-18 14:19:15,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:16,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:16,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:19:16,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2019-01-18 14:19:18,653 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:18,654 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_23, v_subst_2, v_prenex_14, v_subst_3]. (or (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse7 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_23 .cse7)) (.cse2 (select v_main_a_23 (mod (+ .cse7 1) 256))) (.cse3 (mod (+ .cse6 1) 256)) (.cse4 (select v_main_a_23 .cse6)) (.cse1 (select v_main_a_23 (+ v_subst_2 (- 1))))) (and (= .cse0 .cse1) (= .cse2 (select v_main_a_23 .cse3)) (= .cse4 .cse2) (= 0 (select v_main_a_23 v_subst_2)) (= .cse0 .cse2) (= .cse3 main_x) (= main_y (mod (+ .cse3 1) 256)) (= (let ((.cse5 (store v_main_a_23 main_x .cse4))) (store .cse5 main_y (select .cse5 .cse3))) main_a) (= .cse1 1000)))) (let ((.cse14 (mod (+ v_subst_3 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse10 (select v_prenex_14 v_subst_3)) (.cse8 (mod (+ .cse13 1) 256)) (.cse9 (select v_prenex_14 .cse14)) (.cse12 (select v_prenex_14 .cse13))) (and (= main_y (mod (+ .cse8 1) 256)) (= .cse9 .cse10) (= 1000 (select v_prenex_14 (+ v_subst_3 (- 1)))) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse11 (store v_prenex_14 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse8))) main_a) (= main_x .cse8) (= 1000 .cse10) (= (select v_prenex_14 .cse8) .cse9) (= .cse9 .cse12)))))) [2019-01-18 14:19:18,654 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse5 (select main_a main_x))) (or (let ((.cse7 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (let ((.cse6 (mod v_subst_2 256)) (.cse4 (mod (+ .cse7 1) 256))) (let ((.cse2 (mod (+ .cse4 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a (mod (+ .cse6 1) 256))) (.cse3 (select main_a .cse7))) (and (= .cse0 1000) (= .cse1 1000) (= (select main_a .cse2) .cse3) (= .cse4 main_x) (= main_y .cse2) (= 0 (select main_a v_subst_2)) (= .cse5 .cse3) (= .cse0 (select main_a .cse6)) (= .cse1 .cse3))))) (let ((.cse13 (mod (+ v_subst_3 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse9 (select main_a .cse12)) (.cse11 (select main_a .cse13)) (.cse8 (mod (+ .cse12 1) 256)) (.cse10 (select main_a v_subst_3))) (and (= main_y (mod (+ .cse8 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= .cse9 .cse5) (= v_subst_3 (mod v_subst_3 256)) (= .cse9 (select main_a main_y)) (= .cse10 .cse11) (= .cse9 .cse11) (= main_x .cse8) (= .cse10 1000))))))) [2019-01-18 14:19:23,299 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-18 14:19:23,363 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-18 14:19:23,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is VALID [2019-01-18 14:19:25,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2019-01-18 14:19:27,642 INFO L273 TraceCheckUtils]: 3: Hoare triple {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} is UNKNOWN [2019-01-18 14:19:29,656 INFO L273 TraceCheckUtils]: 4: Hoare triple {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} is UNKNOWN [2019-01-18 14:19:29,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} assume a[x] == 0; {192#false} is VALID [2019-01-18 14:19:29,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2019-01-18 14:19:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:29,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:37,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-18 14:19:37,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2019-01-18 14:19:37,741 INFO L273 TraceCheckUtils]: 4: Hoare triple {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-01-18 14:19:37,759 INFO L273 TraceCheckUtils]: 3: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} is VALID [2019-01-18 14:19:37,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-18 14:19:37,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-18 14:19:37,929 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-18 14:19:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 14:19:37,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-01-18 14:19:37,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:37,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 14:19:37,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:37,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-01-18 14:19:45,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 11 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:45,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 14:19:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 14:19:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=136, Unknown=1, NotChecked=0, Total=210 [2019-01-18 14:19:45,331 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-01-18 14:20:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:23,215 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-18 14:20:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 14:20:23,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 14:20:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:20:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 14:20:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-18 14:20:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 14:20:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-18 14:20:23,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2019-01-18 14:20:31,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 14 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2019-01-18 14:20:31,355 INFO L225 Difference]: With dead ends: 15 [2019-01-18 14:20:31,355 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 14:20:31,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=73, Invalid=136, Unknown=1, NotChecked=0, Total=210 [2019-01-18 14:20:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 14:20:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 14:20:31,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:20:31,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-18 14:20:31,417 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-18 14:20:31,417 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-18 14:20:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:31,418 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 14:20:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 14:20:31,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:20:31,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:20:31,419 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-18 14:20:31,419 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-18 14:20:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:31,420 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 14:20:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 14:20:31,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:20:31,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:20:31,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:20:31,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:20:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 14:20:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 14:20:31,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-01-18 14:20:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:20:31,423 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 14:20:31,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 14:20:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 14:20:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 14:20:31,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:20:31,423 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-18 14:20:31,424 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:20:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:20:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2019-01-18 14:20:31,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:20:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:20:31,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 14:20:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:20:31,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:20:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:20:32,461 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-01-18 14:20:32,744 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a main_y)) (<= main_y (+ main_x 1)))} is VALID [2019-01-18 14:20:32,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a main_y)) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} is VALID [2019-01-18 14:20:32,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-18 14:20:32,753 INFO L273 TraceCheckUtils]: 3: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-18 14:20:32,754 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-18 14:20:32,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-18 14:20:32,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-01-18 14:20:32,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-01-18 14:20:32,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {319#(not (= 0 (select main_a main_x)))} is VALID [2019-01-18 14:20:32,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(not (= 0 (select main_a main_x)))} assume a[x] == 0; {314#false} is VALID [2019-01-18 14:20:32,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-18 14:20:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-18 14:20:32,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:20:32,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:20:32,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 14:20:32,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 14:20:32,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:20:32,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 14:20:32,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:20:32,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:20:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:20:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:20:35,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:20:35,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 14:20:35,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-18 14:20:35,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:35,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:35,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:35,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-18 14:20:35,220 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:35,220 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_28]. (and (= (store (store v_main_a_28 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2019-01-18 14:20:35,221 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-18 14:20:35,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2019-01-18 14:20:35,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-18 14:20:35,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:35,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:35,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-18 14:20:35,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:35,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-18 14:20:35,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:35,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:35,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 14:20:35,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-18 14:20:38,966 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:38,967 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_29, main_yold]. (let ((.cse0 (select v_main_a_29 (+ main_yold (- 1))))) (and (= 0 (select v_main_a_29 main_yold)) (= .cse0 1000) (= (mod main_yold 256) main_x) (= main_y (mod (+ main_yold 1) 256)) (= (let ((.cse1 (store v_main_a_29 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a))) [2019-01-18 14:20:38,967 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2019-01-18 14:20:39,324 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-18 14:20:39,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-18 14:20:39,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-18 14:20:39,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:39,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:39,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,505 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:20:39,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 130 [2019-01-18 14:20:39,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:39,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 126 [2019-01-18 14:20:39,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:39,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:39,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:20:39,710 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-18 14:20:41,728 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:41,728 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_16, main_xold, v_main_a_30, v_subst_4]. (or (let ((.cse3 (select v_prenex_16 main_xold)) (.cse0 (select v_prenex_16 (+ main_xold (- 1)))) (.cse1 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 (select v_prenex_16 .cse1)) (= main_x .cse1) (= 1000 .cse0) (= (let ((.cse2 (store v_prenex_16 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1))) main_a) (= .cse3 .cse0) (= main_y (mod (+ .cse1 1) 256)))) (let ((.cse9 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse4 (select v_main_a_30 v_subst_4)) (.cse8 (select v_main_a_30 .cse9)) (.cse6 (select v_main_a_30 (+ v_subst_4 (- 1))))) (and (= .cse4 (select v_main_a_30 .cse5)) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (let ((.cse7 (store v_main_a_30 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse5))) main_a) (= .cse4 0) (= main_x (mod (+ .cse9 1) 256)) (= .cse8 .cse6))))) [2019-01-18 14:20:41,728 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, v_subst_4]. (or (let ((.cse2 (mod (+ main_xold 1) 256))) (let ((.cse1 (select main_a (+ main_xold (- 1)))) (.cse0 (select main_a main_xold)) (.cse3 (mod (+ .cse2 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 .cse1) (= (select main_a main_x) .cse0) (= main_x .cse2) (= main_y .cse3) (= 1000 .cse1) (= .cse0 (select main_a .cse3))))) (let ((.cse7 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse6 (select main_a (+ v_subst_4 (- 1)))) (.cse4 (select main_a .cse7))) (and (= .cse4 (select main_a .cse5)) (= 0 (select main_a v_subst_4)) (= 1000 .cse6) (= main_y (mod (+ .cse5 1) 256)) (= .cse4 .cse6) (= .cse4 (select main_a main_y)) (= main_x (mod (+ .cse7 1) 256)))))) [2019-01-18 14:20:42,050 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-18 14:20:42,960 WARN L181 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-01-18 14:20:42,984 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:20:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,073 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:20:43,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,110 INFO L303 Elim1Store]: Index analysis took 142 ms [2019-01-18 14:20:43,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 259 [2019-01-18 14:20:43,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 178 [2019-01-18 14:20:43,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:43,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:43,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 171 [2019-01-18 14:20:43,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:43,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 127 [2019-01-18 14:20:43,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:43,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:44,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:20:44,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2019-01-18 14:20:46,207 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:46,207 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_17, v_subst_4, v_main_a_31, v_subst_5]. (or (let ((.cse6 (mod v_subst_4 256)) (.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse0 (mod (+ .cse5 1) 256)) (.cse4 (select v_prenex_17 (+ v_subst_4 (- 1)))) (.cse1 (select v_prenex_17 .cse6)) (.cse3 (mod (+ .cse6 1) 256))) (and (= (select v_prenex_17 .cse0) .cse1) (= (let ((.cse2 (store v_prenex_17 main_x (select v_prenex_17 .cse3)))) (store .cse2 main_y (select .cse2 .cse0))) main_a) (= .cse4 1000) (= (select v_prenex_17 .cse5) .cse1) (= (select v_prenex_17 v_subst_4) 0) (= main_y (mod (+ .cse0 1) 256)) (= .cse4 .cse1) (= main_x (mod (+ .cse3 1) 256))))) (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse11 (select v_main_a_31 (+ v_subst_5 (- 1)))) (.cse7 (select v_main_a_31 v_subst_5)) (.cse10 (select v_main_a_31 .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= .cse7 (select v_main_a_31 .cse8)) (= (let ((.cse9 (store v_main_a_31 main_x .cse10))) (store .cse9 main_y (select .cse9 .cse8))) main_a) (= .cse7 .cse11) (= 1000 .cse11) (= .cse7 .cse10) (= main_y (mod (+ .cse8 1) 256)) (= main_x .cse8) (= v_subst_5 (mod v_subst_5 256)))))) [2019-01-18 14:20:46,207 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse2 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_5 1) 256))) (let ((.cse0 (select main_a .cse4)) (.cse3 (select main_a v_subst_5)) (.cse1 (mod (+ .cse4 1) 256))) (and (= .cse0 (select main_a .cse1)) (= .cse0 .cse2) (= .cse3 .cse0) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= .cse3 1000) (= main_y (mod (+ .cse1 1) 256)) (= main_x .cse1) (= v_subst_5 (mod v_subst_5 256))))) (let ((.cse9 (mod (+ v_subst_4 1) 256))) (let ((.cse5 (select main_a (mod v_subst_4 256))) (.cse7 (select main_a (+ v_subst_4 (- 1)))) (.cse8 (mod (+ .cse9 1) 256)) (.cse6 (select main_a .cse9))) (and (= .cse5 .cse6) (= 0 (select main_a v_subst_4)) (= 1000 .cse7) (= main_y (mod (+ .cse8 1) 256)) (= .cse5 .cse7) (= .cse6 .cse2) (= main_x .cse8) (= .cse6 (select main_a main_x))))))) [2019-01-18 14:20:48,541 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-18 14:20:51,579 WARN L181 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-18 14:20:51,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 298 [2019-01-18 14:20:51,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:51,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 214 [2019-01-18 14:20:51,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:51,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:54,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:54,974 INFO L303 Elim1Store]: Index analysis took 325 ms [2019-01-18 14:20:54,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 378 [2019-01-18 14:20:55,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:55,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:55,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:55,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:55,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:55,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:55,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 287 [2019-01-18 14:20:55,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:55,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:55,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:20:55,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2019-01-18 14:20:57,788 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:57,788 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_18, v_subst_5, v_main_a_32, v_subst_4]. (or (let ((.cse6 (mod (+ v_subst_5 1) 256))) (let ((.cse5 (mod (+ .cse6 1) 256))) (let ((.cse0 (select v_prenex_18 v_subst_5)) (.cse3 (select v_prenex_18 .cse6)) (.cse2 (select v_prenex_18 .cse5)) (.cse1 (mod (+ .cse5 1) 256))) (and (= .cse0 1000) (= main_x .cse1) (= .cse0 (select v_prenex_18 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= .cse0 .cse3) (= .cse3 (select v_prenex_18 .cse1)) (= (let ((.cse4 (store v_prenex_18 main_x .cse2))) (store .cse4 main_y (select .cse4 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse1 1) 256)))))) (let ((.cse14 (mod (+ v_subst_4 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse8 (select v_main_a_32 (+ v_subst_4 (- 1)))) (.cse10 (select v_main_a_32 (mod v_subst_4 256))) (.cse7 (mod (+ .cse13 1) 256)) (.cse9 (select v_main_a_32 .cse14)) (.cse12 (select v_main_a_32 .cse13))) (and (= (mod (+ .cse7 1) 256) main_y) (= (select v_main_a_32 v_subst_4) 0) (= 1000 .cse8) (= .cse9 .cse10) (= .cse8 .cse10) (= (select v_main_a_32 .cse7) .cse9) (= main_x .cse7) (= (let ((.cse11 (store v_main_a_32 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse7))) main_a) (= .cse9 .cse12)))))) [2019-01-18 14:20:57,789 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse5 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse6 (mod (+ .cse7 1) 256))) (let ((.cse2 (select main_a v_subst_5)) (.cse1 (select main_a .cse6)) (.cse0 (select main_a .cse7)) (.cse3 (mod (+ .cse6 1) 256))) (and (= .cse0 .cse1) (= .cse2 .cse0) (= .cse2 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse3) (= .cse1 .cse4) (= .cse1 .cse5) (= v_subst_5 (mod v_subst_5 256)) (= .cse0 1000) (= main_y (mod (+ .cse3 1) 256)))))) (let ((.cse13 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse11 (select main_a (+ v_subst_4 (- 1)))) (.cse9 (select main_a .cse13)) (.cse10 (select main_a .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= (mod (+ .cse8 1) 256) main_y) (= .cse9 .cse10) (= 0 (select main_a v_subst_4)) (= 1000 .cse11) (= .cse5 .cse10) (= (select main_a (mod v_subst_4 256)) .cse11) (= .cse9 1000) (= .cse4 .cse10) (= main_x .cse8))))))) [2019-01-18 14:21:05,127 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 64 [2019-01-18 14:21:10,872 WARN L181 SmtUtils]: Spent 5.66 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-18 14:21:10,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:10,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,022 INFO L303 Elim1Store]: Index analysis took 138 ms [2019-01-18 14:21:11,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 491 [2019-01-18 14:21:11,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:11,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 367 [2019-01-18 14:21:11,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:21:11,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:21:15,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:15,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:16,885 INFO L303 Elim1Store]: Index analysis took 1572 ms [2019-01-18 14:21:16,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 585 [2019-01-18 14:21:17,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:17,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:17,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:17,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:17,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:17,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:17,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:17,124 INFO L303 Elim1Store]: Index analysis took 155 ms [2019-01-18 14:21:17,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 450 [2019-01-18 14:21:17,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:21:18,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:21:19,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:21:19,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2019-01-18 14:21:21,915 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:21:21,915 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_33, v_subst_4, v_prenex_19, v_subst_5]. (or (let ((.cse7 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse6 (mod (+ .cse8 1) 256))) (let ((.cse4 (select v_main_a_33 (+ v_subst_4 (- 1)))) (.cse2 (select v_main_a_33 .cse8)) (.cse1 (select v_main_a_33 .cse7)) (.cse0 (mod (+ .cse6 1) 256)) (.cse3 (select v_main_a_33 .cse6))) (and (= main_y (mod (+ .cse0 1) 256)) (= .cse1 1000) (= .cse2 (select v_main_a_33 .cse0)) (= (select v_main_a_33 v_subst_4) 0) (= .cse2 .cse3) (= (select v_main_a_33 (mod v_subst_4 256)) .cse4) (= .cse0 main_x) (= 1000 .cse4) (= .cse2 .cse1) (= (let ((.cse5 (store v_main_a_33 main_x .cse3))) (store .cse5 main_y (select .cse5 .cse0))) main_a)))))) (let ((.cse15 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse15 1) 256))) (let ((.cse16 (mod (+ .cse17 1) 256))) (let ((.cse10 (select v_prenex_19 .cse17)) (.cse12 (select v_prenex_19 .cse16)) (.cse9 (mod (+ .cse16 1) 256)) (.cse14 (select v_prenex_19 v_subst_5)) (.cse11 (select v_prenex_19 .cse15))) (and (= main_x .cse9) (= .cse10 .cse11) (= (select v_prenex_19 .cse9) .cse10) (= .cse12 .cse10) (= (let ((.cse13 (store v_prenex_19 main_x .cse12))) (store .cse13 main_y (select .cse13 .cse9))) main_a) (= main_y (mod (+ .cse9 1) 256)) (= .cse14 (select v_prenex_19 (+ v_subst_5 (- 1)))) (= 1000 .cse11) (= .cse14 .cse11) (= v_subst_5 (mod v_subst_5 256)))))))) [2019-01-18 14:21:21,916 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse6 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse3 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse3 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse1 (select main_a .cse8)) (.cse2 (select main_a .cse7)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse7 1) 256))) (and (= main_y (mod (+ .cse0 1) 256)) (= 1000 .cse1) (= .cse2 .cse1) (= (select main_a .cse3) .cse1) (= .cse2 .cse4) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= .cse2 .cse6) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse0 main_x)))))) (let ((.cse14 (mod (+ v_subst_5 1) 256))) (let ((.cse16 (mod (+ .cse14 1) 256))) (let ((.cse15 (mod (+ .cse16 1) 256))) (let ((.cse10 (select main_a v_subst_5)) (.cse9 (select main_a .cse15)) (.cse13 (select main_a .cse16)) (.cse12 (mod (+ .cse15 1) 256)) (.cse11 (select main_a .cse14))) (and (= .cse9 .cse6) (= .cse10 .cse11) (= main_x .cse12) (= .cse10 (select main_a (+ v_subst_5 (- 1)))) (= .cse13 1000) (= .cse9 .cse4) (= .cse9 .cse13) (= main_y (mod (+ .cse12 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= .cse11 1000)))))))) [2019-01-18 14:21:39,991 WARN L181 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 72 [2019-01-18 14:21:54,167 WARN L181 SmtUtils]: Spent 14.08 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-01-18 14:21:54,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:54,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:54,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:54,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:54,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:55,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:55,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:55,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:55,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:55,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:55,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:58,426 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) v_subst_4) [2019-01-18 14:21:58,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:58,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:59,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:59,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:59,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:59,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:59,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:21:59,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:00,910 INFO L303 Elim1Store]: Index analysis took 6729 ms [2019-01-18 14:22:00,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 876 [2019-01-18 14:22:01,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:01,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 713 [2019-01-18 14:22:01,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:22:05,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:22:21,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 746 [2019-01-18 14:22:21,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:22:21,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 574 [2019-01-18 14:22:21,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:22:22,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:22:24,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:22:24,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:547, output treesize:445 [2019-01-18 14:22:26,869 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:22:26,870 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_20, v_subst_5, v_main_a_34, v_subst_4]. (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse9 (mod (+ .cse7 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse2 (select v_prenex_20 v_subst_5)) (.cse1 (mod (+ .cse10 1) 256)) (.cse5 (select v_prenex_20 .cse10)) (.cse4 (select v_prenex_20 .cse9)) (.cse0 (select v_prenex_20 .cse8)) (.cse3 (select v_prenex_20 .cse7))) (and (= .cse0 (select v_prenex_20 .cse1)) (= main_x .cse1) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 (select v_prenex_20 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= 1000 .cse4) (= .cse0 .cse5) (= (let ((.cse6 (store v_prenex_20 main_x .cse5))) (store .cse6 main_y (select .cse6 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 .cse0) (= .cse3 1000))))))) (let ((.cse17 (mod (+ v_subst_4 1) 256))) (let ((.cse18 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse18 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse11 (select v_main_a_34 .cse20)) (.cse14 (mod (+ .cse20 1) 256)) (.cse12 (select v_main_a_34 .cse19)) (.cse13 (select v_main_a_34 .cse18)) (.cse15 (select v_main_a_34 (+ v_subst_4 (- 1))))) (and (= .cse11 .cse12) (= .cse13 .cse12) (= main_y (mod (+ .cse14 1) 256)) (= .cse15 1000) (= (select v_main_a_34 v_subst_4) 0) (= .cse13 1000) (= main_a (let ((.cse16 (store v_main_a_34 main_x .cse11))) (store .cse16 main_y (select .cse16 .cse14)))) (= main_x .cse14) (= (select v_main_a_34 .cse14) .cse12) (= .cse13 (select v_main_a_34 .cse17)) (= .cse15 (select v_main_a_34 (mod v_subst_4 256)))))))))) [2019-01-18 14:22:26,870 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse0 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse9 (mod (+ .cse8 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a v_subst_5)) (.cse5 (mod (+ .cse10 1) 256)) (.cse1 (select main_a .cse10)) (.cse2 (select main_a .cse9)) (.cse6 (select main_a .cse8)) (.cse4 (select main_a .cse7))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 .cse4) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse5) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (select main_a main_y) .cse1) (= .cse2 .cse6) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 1000))))))) (let ((.cse11 (mod (+ v_subst_4 1) 256))) (let ((.cse20 (mod (+ .cse11 1) 256))) (let ((.cse19 (mod (+ .cse20 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse12 (select main_a .cse20)) (.cse16 (select main_a (+ v_subst_4 (- 1)))) (.cse13 (select main_a .cse19)) (.cse15 (select main_a .cse18)) (.cse14 (mod (+ .cse17 1) 256))) (and (= (select main_a .cse11) .cse12) (= .cse13 .cse12) (= 1000 .cse12) (= main_y .cse14) (= 0 (select main_a v_subst_4)) (= .cse15 .cse0) (= 1000 .cse16) (= (select main_a (mod v_subst_4 256)) .cse16) (= main_x .cse17) (= .cse13 .cse15) (= .cse15 (select main_a .cse14))))))))))) [2019-01-18 14:22:53,193 WARN L181 SmtUtils]: Spent 3.61 s on a formula simplification that was a NOOP. DAG size: 81 [2019-01-18 14:23:14,674 WARN L181 SmtUtils]: Spent 21.37 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-18 14:23:14,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:14,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:15,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:16,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:18,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:18,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:18,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:18,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:18,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:18,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:18,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:19,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:19,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:19,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:19,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:19,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:19,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:19,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:20,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:20,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:20,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:20,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:20,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:20,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,253 INFO L303 Elim1Store]: Index analysis took 6563 ms [2019-01-18 14:23:21,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 1173 [2019-01-18 14:23:21,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:21,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 1238 [2019-01-18 14:23:21,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:23:25,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:23:55,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,282 INFO L303 Elim1Store]: Index analysis took 250 ms [2019-01-18 14:23:55,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 1091 [2019-01-18 14:23:55,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:23:55,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 863 [2019-01-18 14:23:55,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:23:56,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:24:03,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:24:03,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:689, output treesize:557 [2019-01-18 14:24:05,616 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:24:05,616 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_subst_4, v_prenex_21, v_subst_5]. (or (let ((.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse9 (mod (+ .cse11 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse7 (select v_main_a_35 .cse10)) (.cse0 (select v_main_a_35 .cse11)) (.cse4 (select v_main_a_35 (+ v_subst_4 (- 1)))) (.cse2 (mod (+ .cse10 1) 256)) (.cse1 (select v_main_a_35 .cse9)) (.cse3 (select v_main_a_35 .cse8))) (and (= .cse0 .cse1) (= (select v_main_a_35 .cse2) .cse3) (= .cse4 (select v_main_a_35 (mod v_subst_4 256))) (= .cse0 (select v_main_a_35 .cse5)) (= (select v_main_a_35 v_subst_4) 0) (= main_x .cse2) (= (let ((.cse6 (store v_main_a_35 main_x .cse7))) (store .cse6 main_y (select .cse6 .cse2))) main_a) (= .cse7 .cse3) (= .cse0 1000) (= .cse4 1000) (= main_y (mod (+ .cse2 1) 256)) (= .cse1 .cse3)))))))) (let ((.cse24 (mod (+ v_subst_5 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse20 (mod (+ .cse22 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse12 (select v_prenex_21 .cse24)) (.cse13 (mod (+ .cse21 1) 256)) (.cse15 (select v_prenex_21 .cse23)) (.cse17 (select v_prenex_21 v_subst_5)) (.cse16 (select v_prenex_21 .cse22)) (.cse19 (select v_prenex_21 .cse21)) (.cse14 (select v_prenex_21 .cse20))) (and (= .cse12 1000) (= (select v_prenex_21 .cse13) .cse14) (= .cse15 .cse16) (= .cse12 .cse17) (= (mod (+ .cse13 1) 256) main_y) (= main_x .cse13) (= main_a (let ((.cse18 (store v_prenex_21 main_x .cse19))) (store .cse18 main_y (select .cse18 .cse13)))) (= 1000 .cse15) (= .cse17 (select v_prenex_21 (+ v_subst_5 (- 1)))) (= .cse14 .cse16) (= .cse19 .cse14) (= v_subst_5 (mod v_subst_5 256)))))))))) [2019-01-18 14:24:05,616 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse7 (select main_a main_y))) (or (let ((.cse2 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse2 1) 256))) (let ((.cse4 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse4 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a .cse10)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse8 1) 256)) (.cse6 (select main_a .cse9)) (.cse1 (select main_a .cse8))) (and (= (select main_a .cse0) .cse1) (= (select main_a .cse2) .cse3) (= (select main_a .cse4) .cse3) (= 1000 .cse3) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= main_x .cse0) (= .cse6 1000) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse7 .cse1) (= main_y (mod (+ .cse0 1) 256)) (= .cse6 .cse1)))))))) (let ((.cse18 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse21 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse21 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse12 (select main_a v_subst_5)) (.cse15 (mod (+ .cse20 1) 256)) (.cse14 (select main_a .cse21)) (.cse16 (select main_a .cse20)) (.cse11 (select main_a .cse19)) (.cse13 (select main_a .cse18))) (and (= 1000 .cse11) (= .cse12 .cse13) (= .cse14 .cse11) (= .cse12 (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse15 1) 256) main_y) (= main_x .cse15) (= .cse16 (select main_a main_x)) (= .cse14 (select main_a .cse17)) (= .cse16 .cse7) (= .cse16 .cse11) (= v_subst_5 (mod v_subst_5 256)) (= .cse13 1000)))))))))) [2019-01-18 14:24:35,744 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 89 [2019-01-18 14:25:07,178 WARN L181 SmtUtils]: Spent 31.27 s on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-01-18 14:25:08,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:08,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:08,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:08,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:09,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:09,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:09,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:09,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:09,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:10,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:10,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:10,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:10,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:10,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:10,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:11,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:11,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:11,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:11,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:12,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:12,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:12,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:12,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:12,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:13,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:13,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:14,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:14,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:14,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:15,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:15,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:15,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:15,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:16,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:16,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:16,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:16,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:16,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,625 INFO L303 Elim1Store]: Index analysis took 10431 ms [2019-01-18 14:25:17,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 1732 [2019-01-18 14:25:17,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:25:17,940 INFO L303 Elim1Store]: Index analysis took 232 ms [2019-01-18 14:25:17,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 57 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 1417 [2019-01-18 14:25:17,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:25:35,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:26:14,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:14,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,209 INFO L303 Elim1Store]: Index analysis took 431 ms [2019-01-18 14:26:15,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 1540 [2019-01-18 14:26:15,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:26:15,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 1248 [2019-01-18 14:26:15,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:26:16,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:26:26,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 14:26:26,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:841, output treesize:653 [2019-01-18 14:26:28,151 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:26:28,151 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_22, v_subst_4, v_main_a_36, v_subst_5]. (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse6 1) 256))) (let ((.cse5 (mod (+ .cse12 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse10 (mod (+ .cse11 1) 256))) (let ((.cse9 (mod (+ .cse10 1) 256))) (let ((.cse4 (select v_prenex_22 (+ v_subst_4 (- 1)))) (.cse0 (select v_prenex_22 .cse12)) (.cse2 (select v_prenex_22 .cse11)) (.cse1 (mod (+ .cse9 1) 256)) (.cse3 (select v_prenex_22 .cse10)) (.cse8 (select v_prenex_22 .cse9))) (and (= 1000 .cse0) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 .cse3) (= .cse3 (select v_prenex_22 .cse1)) (= main_x .cse1) (= .cse4 (select v_prenex_22 (mod v_subst_4 256))) (= 0 (select v_prenex_22 v_subst_4)) (= (select v_prenex_22 .cse5) .cse0) (= .cse4 1000) (= .cse0 (select v_prenex_22 .cse6)) (= .cse2 1000) (= (let ((.cse7 (store v_prenex_22 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse1))) main_a) (= .cse3 .cse8))))))))) (let ((.cse25 (mod (+ v_subst_5 1) 256))) (let ((.cse21 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse26 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse26 1) 256))) (let ((.cse15 (select v_main_a_36 .cse26)) (.cse18 (select v_main_a_36 v_subst_5)) (.cse13 (select v_main_a_36 .cse25)) (.cse17 (mod (+ .cse24 1) 256)) (.cse14 (select v_main_a_36 .cse24)) (.cse20 (select v_main_a_36 .cse23)) (.cse16 (select v_main_a_36 .cse22))) (and (= 1000 .cse13) (= .cse14 .cse15) (= .cse15 .cse16) (= .cse17 main_x) (= (select v_main_a_36 (+ v_subst_5 (- 1))) .cse18) (= (select v_main_a_36 .cse17) .cse15) (= .cse18 .cse13) (= main_y (mod (+ .cse17 1) 256)) (= 1000 .cse16) (= (let ((.cse19 (store v_main_a_36 main_x .cse14))) (store .cse19 main_y (select .cse19 .cse17))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse20 (select v_main_a_36 .cse21)) (= .cse20 .cse16)))))))))) [2019-01-18 14:26:28,151 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse2 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse6 1) 256))) (let ((.cse8 (mod (+ .cse10 1) 256))) (let ((.cse5 (mod (+ .cse8 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse12 (mod (+ .cse11 1) 256))) (let ((.cse0 (mod (+ .cse12 1) 256)) (.cse3 (select main_a .cse12)) (.cse1 (select main_a .cse11)) (.cse7 (select main_a .cse10)) (.cse9 (select main_a (+ v_subst_4 (- 1))))) (and (= main_y (mod (+ .cse0 1) 256)) (= main_x .cse0) (= 1000 .cse1) (= .cse2 .cse3) (= .cse4 .cse3) (= (select main_a .cse5) .cse1) (= .cse3 .cse1) (= (select main_a .cse6) .cse7) (= (select main_a .cse8) .cse7) (= 1000 .cse7) (= 0 (select main_a v_subst_4)) (= 1000 .cse9) (= (select main_a (mod v_subst_4 256)) .cse9))))))))) (let ((.cse21 (mod (+ v_subst_5 1) 256))) (let ((.cse20 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse20 1) 256))) (let ((.cse25 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse13 (select main_a .cse25)) (.cse15 (mod (+ .cse23 1) 256)) (.cse18 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse17 (select main_a v_subst_5)) (.cse16 (select main_a .cse22)) (.cse19 (select main_a .cse21))) (and (= 1000 .cse13) (= .cse2 .cse14) (= .cse4 .cse14) (= .cse15 main_x) (= .cse16 .cse13) (= .cse17 (select main_a (+ v_subst_5 (- 1)))) (= .cse18 1000) (= main_y (mod (+ .cse15 1) 256)) (= .cse18 .cse14) (= .cse17 .cse19) (= .cse16 (select main_a .cse20)) (= v_subst_5 (mod v_subst_5 256)) (= .cse19 1000))))))))))) [2019-01-18 14:27:08,461 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 96 [2019-01-18 14:27:08,579 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {323#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-18 14:27:09,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {327#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is VALID [2019-01-18 14:27:11,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2019-01-18 14:27:13,496 INFO L273 TraceCheckUtils]: 3: Hoare triple {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a v_subst_5) 1000) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} is UNKNOWN [2019-01-18 14:27:15,505 INFO L273 TraceCheckUtils]: 4: Hoare triple {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a v_subst_5) 1000) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {339#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)))))} is UNKNOWN [2019-01-18 14:27:17,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} is UNKNOWN [2019-01-18 14:27:19,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {347#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-18 14:27:21,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {347#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {351#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-18 14:27:23,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {355#(or (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-18 14:27:23,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#(or (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} assume a[x] == 0; {314#false} is VALID [2019-01-18 14:27:23,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-18 14:27:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 17 refuted. 19 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:27:23,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:27:38,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {314#false} is VALID [2019-01-18 14:27:38,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {362#(= (select main_a main_y) 1000)} is VALID [2019-01-18 14:27:38,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-01-18 14:27:38,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {370#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} is VALID [2019-01-18 14:27:39,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-18 14:27:39,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-18 14:27:41,461 INFO L273 TraceCheckUtils]: 4: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is UNKNOWN [2019-01-18 14:27:43,469 INFO L273 TraceCheckUtils]: 3: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is UNKNOWN [2019-01-18 14:27:43,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-18 14:27:45,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is UNKNOWN [2019-01-18 14:27:45,597 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-18 14:27:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 14:27:45,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:27:45,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 4] total 19 [2019-01-18 14:27:45,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:27:45,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-18 14:27:45,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:27:45,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-01-18 14:28:01,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 11 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2019-01-18 14:28:01,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 14:28:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 14:28:01,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=211, Unknown=48, NotChecked=0, Total=380 [2019-01-18 14:28:01,769 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-01-18 14:31:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:31:59,724 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-18 14:31:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 14:31:59,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-18 14:31:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:31:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 14:31:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-18 14:31:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 14:31:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-18 14:31:59,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 14 transitions. [2019-01-18 14:32:14,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 7 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2019-01-18 14:32:14,751 INFO L225 Difference]: With dead ends: 13 [2019-01-18 14:32:14,751 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 14:32:14,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 133.5s TimeCoverageRelationStatistics Valid=121, Invalid=211, Unknown=48, NotChecked=0, Total=380 [2019-01-18 14:32:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 14:32:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 14:32:14,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:32:14,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-18 14:32:14,752 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 14:32:14,752 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 14:32:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:32:14,753 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 14:32:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:32:14,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:32:14,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:32:14,753 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 14:32:14,753 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 14:32:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:32:14,753 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 14:32:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:32:14,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:32:14,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:32:14,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:32:14,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:32:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 14:32:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 14:32:14,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-18 14:32:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:32:14,754 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 14:32:14,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 14:32:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:32:14,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:32:14,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 14:32:31,079 WARN L181 SmtUtils]: Spent 16.26 s on a formula simplification. DAG size of input: 374 DAG size of output: 35 [2019-01-18 14:32:31,087 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 9 30) no Hoare annotation was computed. [2019-01-18 14:32:31,087 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-18 14:32:31,087 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 9 30) no Hoare annotation was computed. [2019-01-18 14:32:31,087 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 30) no Hoare annotation was computed. [2019-01-18 14:32:31,087 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 28) no Hoare annotation was computed. [2019-01-18 14:32:31,088 INFO L444 ceAbstractionStarter]: At program point L18-1(lines 18 29) the Hoare annotation is: (let ((.cse0 (select main_a main_x)) (.cse1 (select main_a main_y))) (or (and (= .cse0 1000) (= .cse1 0) (= main_y (+ main_x 1))) (and (= .cse0 .cse1) (not (= 0 .cse1))) (exists ((main_yold Int)) (let ((.cse2 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse2) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) .cse2) (= (select main_a main_x) .cse3) (= 1000 .cse3)))))) [2019-01-18 14:32:31,089 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-18 14:32:33,104 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-18 14:32:33,104 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-01-18 14:32:33,104 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-18 14:32:33,104 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-18 14:32:33,104 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-01-18 14:32:33,105 INFO L163 areAnnotationChecker]: CFG has 1 edges. 0 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-18 14:32:33,112 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 02:32:33 BoogieIcfgContainer [2019-01-18 14:32:33,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 14:32:33,114 INFO L168 Benchmark]: Toolchain (without parser) took 868004.19 ms. Allocated memory was 133.7 MB in the beginning and 350.2 MB in the end (delta: 216.5 MB). Free memory was 109.0 MB in the beginning and 129.4 MB in the end (delta: -20.4 MB). Peak memory consumption was 196.1 MB. Max. memory is 7.1 GB. [2019-01-18 14:32:33,115 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 14:32:33,115 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.15 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-18 14:32:33,115 INFO L168 Benchmark]: Boogie Preprocessor took 27.34 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 14:32:33,116 INFO L168 Benchmark]: RCFGBuilder took 285.45 ms. Allocated memory is still 133.7 MB. Free memory was 105.8 MB in the beginning and 95.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-18 14:32:33,116 INFO L168 Benchmark]: TraceAbstraction took 867647.53 ms. Allocated memory was 133.7 MB in the beginning and 350.2 MB in the end (delta: 216.5 MB). Free memory was 95.6 MB in the beginning and 129.4 MB in the end (delta: -33.8 MB). Peak memory consumption was 182.7 MB. Max. memory is 7.1 GB. [2019-01-18 14:32:33,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.15 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.34 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 285.45 ms. Allocated memory is still 133.7 MB. Free memory was 105.8 MB in the beginning and 95.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 867647.53 ms. Allocated memory was 133.7 MB in the beginning and 350.2 MB in the end (delta: 216.5 MB). Free memory was 95.6 MB in the beginning and 129.4 MB in the end (delta: -33.8 MB). Peak memory consumption was 182.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((a[x] == 1000 && a[y] == 0) && y == x + 1) || (a[x] == a[y] && !(0 == a[y]))) || (exists main_yold : int :: ((((main_yold % 256 == x && 0 == a[main_yold]) && y == (main_yold + 1) % 256) && a[y] == a[main_yold]) && a[x] == a[main_yold + -1]) && 1000 == a[main_yold + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 865.5s OverallTime, 5 OverallIterations, 8 TraceHistogramMax, 323.4s AutomataDifference, 0.0s DeadEndRemovalTime, 16.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 80 SolverSat, 9 SolverUnsat, 70 SolverUnknown, 0 SolverNotchecked, 147.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 144.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 73 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 3453 FormulaSimplificationTreeSizeReductionInter, 16.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 492.6s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 18 QuantifiedInterpolants, 58064 SizeOfPredicates, 38 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 32/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...