java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:30:39,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:30:39,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:30:39,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:30:39,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:30:39,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:30:39,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:30:39,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:30:39,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:30:39,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:30:39,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:30:39,937 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:30:39,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:30:39,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:30:39,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:30:39,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:30:39,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:30:39,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:30:39,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:30:39,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:30:39,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:30:39,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:30:39,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:30:39,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:30:39,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:30:39,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:30:39,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:30:39,964 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:30:39,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:30:39,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:30:39,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:30:39,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:30:39,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:30:39,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:30:39,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:30:39,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:30:39,974 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-18 22:30:39,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:30:39,996 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:30:39,996 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:30:39,997 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:30:39,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:30:39,997 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:30:39,997 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:30:39,998 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:30:39,998 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:30:39,998 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-18 22:30:39,998 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-18 22:30:39,998 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:30:39,999 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:30:39,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:30:39,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:30:40,000 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:30:40,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:30:40,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:30:40,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:30:40,001 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:30:40,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:30:40,001 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:30:40,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:30:40,001 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:30:40,002 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:30:40,002 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:30:40,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:30:40,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:30:40,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:30:40,003 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:30:40,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:30:40,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:30:40,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:30:40,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:30:40,004 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:30:40,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:30:40,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:30:40,004 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:30:40,004 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:30:40,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:30:40,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:30:40,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:30:40,066 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:30:40,066 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:30:40,067 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2018-12-18 22:30:40,067 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2018-12-18 22:30:40,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:30:40,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:30:40,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:30:40,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:30:40,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:30:40,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,139 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-18 22:30:40,140 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-18 22:30:40,140 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-18 22:30:40,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:30:40,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:30:40,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:30:40,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:30:40,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... [2018-12-18 22:30:40,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:30:40,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:30:40,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:30:40,169 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:30:40,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:30:40,243 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-18 22:30:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-18 22:30:40,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-18 22:30:40,573 INFO L272 CfgBuilder]: Using library mode [2018-12-18 22:30:40,574 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-18 22:30:40,574 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:30:40 BoogieIcfgContainer [2018-12-18 22:30:40,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:30:40,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:30:40,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:30:40,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:30:40,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:40" (1/2) ... [2018-12-18 22:30:40,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3807467a and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:30:40, skipping insertion in model container [2018-12-18 22:30:40,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:30:40" (2/2) ... [2018-12-18 22:30:40,581 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2018-12-18 22:30:40,591 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:30:40,599 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-18 22:30:40,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-18 22:30:40,648 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:30:40,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:30:40,648 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:30:40,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:30:40,649 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:30:40,649 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:30:40,649 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:30:40,649 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:30:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-18 22:30:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:30:40,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:30:40,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:30:40,674 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:30:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:30:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-18 22:30:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:30:40,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:40,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:30:40,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:40,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:30:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:30:41,216 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} is VALID [2018-12-18 22:30:41,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} assume a[x] == 0; {12#(= (select main_a main_y) 1000)} is VALID [2018-12-18 22:30:41,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2018-12-18 22:30:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:30:41,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:30:41,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-18 22:30:41,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:30:41,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:30:41,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:30:41,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:30:41,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:30:41,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:30:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:30:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-18 22:30:41,283 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-12-18 22:30:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:30:41,543 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-18 22:30:41,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-18 22:30:41,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:30:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:30:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:30:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-18 22:30:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:30:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-18 22:30:41,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2018-12-18 22:30:41,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:30:41,722 INFO L225 Difference]: With dead ends: 15 [2018-12-18 22:30:41,723 INFO L226 Difference]: Without dead ends: 5 [2018-12-18 22:30:41,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-18 22:30:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-18 22:30:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-18 22:30:41,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:30:41,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-18 22:30:41,818 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-18 22:30:41,818 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-18 22:30:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:30:41,820 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-18 22:30:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 22:30:41,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:30:41,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:30:41,821 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-18 22:30:41,821 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-18 22:30:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:30:41,823 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-18 22:30:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 22:30:41,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:30:41,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:30:41,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:30:41,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:30:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-18 22:30:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-18 22:30:41,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-18 22:30:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:30:41,828 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-18 22:30:41,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:30:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 22:30:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-18 22:30:41,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:30:41,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-18 22:30:41,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:30:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:30:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-18 22:30:41,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:30:41,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:41,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:30:41,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:41,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:30:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:30:42,109 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} is VALID [2018-12-18 22:30:42,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {52#(= (select main_a main_x) 1000)} is VALID [2018-12-18 22:30:42,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2018-12-18 22:30:42,141 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-18 22:30:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:30:42,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:30:42,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:30:42,143 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-18 22:30:42,147 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-18 22:30:42,215 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-18 22:30:42,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:30:45,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:30:45,665 INFO L272 AbstractInterpreter]: Visited 4 different actions 9 times. Merged at 3 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:30:45,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:30:45,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:30:45,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:30:45,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:30:45,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:30:45,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:30:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:30:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:30:45,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:30:45,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-18 22:30:45,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:45,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:45,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-18 22:30:45,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:30:45,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:30:45,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:30:45,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-18 22:30:45,821 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:30:45,822 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_11]. (and (= main_a (store (store v_main_a_11 main_x 1000) main_y 0)) (= main_y (+ main_x 1))) [2018-12-18 22:30:45,822 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-18 22:30:45,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:45,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:45,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2018-12-18 22:30:46,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 70 [2018-12-18 22:30:46,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:30:46,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 90 [2018-12-18 22:30:46,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-18 22:30:46,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-18 22:30:46,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 57 [2018-12-18 22:30:46,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:46,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-12-18 22:30:46,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-18 22:30:46,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:47,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:47,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:47,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:47,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:47,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:47,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:30:47,130 INFO L303 Elim1Store]: Index analysis took 180 ms [2018-12-18 22:30:47,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 86 [2018-12-18 22:30:47,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-18 22:30:47,240 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-18 22:30:47,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-18 22:30:47,329 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2018-12-18 22:30:49,517 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:30:49,518 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_12, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse2 (select v_main_a_12 main_xold))) (and (= (select v_main_a_12 .cse0) 0) (= main_x (mod .cse0 256)) (= (let ((.cse1 (store v_main_a_12 main_x .cse2))) (store .cse1 (mod (+ main_xold 2) 256) (select .cse1 main_yold))) main_a) (= .cse2 1000))) [2018-12-18 22:30:49,518 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4, v_prenex_3]. (let ((.cse6 (select main_a main_x)) (.cse1 (select main_a (+ main_x (- 1))))) (let ((.cse2 (= main_x (mod main_x 256))) (.cse3 (= 1000 .cse1)) (.cse0 (select main_a (mod (+ main_x 1) 256))) (.cse4 (= .cse6 .cse1))) (or (and (= .cse0 .cse1) .cse2 .cse3 .cse4) (let ((.cse5 (select main_a v_prenex_4)) (.cse7 (+ v_prenex_4 1))) (and (= (select main_a (mod (+ v_prenex_4 2) 256)) .cse5) (= .cse6 .cse5) (= .cse5 1000) (= 0 (select main_a .cse7)) (= main_x (mod .cse7 256)))) (and .cse2 .cse3 (= .cse0 (select main_a v_prenex_3)) .cse4) (let ((.cse8 (select main_a main_xold)) (.cse9 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse6 .cse8) (= 0 (select main_a .cse9)) (= .cse8 1000) (= main_x (mod .cse9 256))))))) [2018-12-18 22:30:49,701 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-12-18 22:30:49,767 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-18 22:30:51,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2018-12-18 22:30:51,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} assume a[x] == 0; {50#false} is VALID [2018-12-18 22:30:51,790 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-18 22:30:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:30:51,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:30:52,244 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-18 22:30:52,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2018-12-18 22:30:52,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {70#(not (= (select main_a main_x) 0))} is VALID [2018-12-18 22:30:52,248 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-18 22:30:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:30:52,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:30:52,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-18 22:30:52,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:30:52,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-18 22:30:52,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:30:52,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-18 22:30:54,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-18 22:30:54,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-18 22:30:54,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-18 22:30:54,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:30:54,308 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-18 22:30:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:30:58,441 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 22:30:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-18 22:30:58,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-18 22:30:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:30:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:30:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-18 22:30:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:30:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-18 22:30:58,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2018-12-18 22:31:00,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:00,486 INFO L225 Difference]: With dead ends: 8 [2018-12-18 22:31:00,486 INFO L226 Difference]: Without dead ends: 6 [2018-12-18 22:31:00,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:31:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-18 22:31:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-18 22:31:00,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:31:00,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-18 22:31:00,509 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-18 22:31:00,509 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-18 22:31:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:00,510 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-18 22:31:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 22:31:00,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:00,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:00,511 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-18 22:31:00,511 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-18 22:31:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:00,512 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-18 22:31:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 22:31:00,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:00,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:00,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:31:00,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:31:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:31:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-18 22:31:00,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-18 22:31:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:31:00,515 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-18 22:31:00,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-18 22:31:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 22:31:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-18 22:31:00,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:31:00,516 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-18 22:31:00,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:31:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:31:00,517 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-18 22:31:00,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:31:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:00,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:31:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:00,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:31:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:00,768 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2018-12-18 22:31:00,849 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2018-12-18 22:31:00,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} is VALID [2018-12-18 22:31:00,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {113#(= 1000 (select main_a main_x))} is VALID [2018-12-18 22:31:00,857 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2018-12-18 22:31:00,857 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-18 22:31:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:31:00,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:31:00,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:31:00,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 22:31:00,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 22:31:00,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:31:00,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:31:00,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-18 22:31:00,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-18 22:31:00,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-18 22:31:00,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 22:31:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:00,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:31:00,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-18 22:31:00,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:00,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:00,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-18 22:31:00,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:00,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:00,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:00,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-18 22:31:00,944 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:00,944 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_14]. (and (= (store (store v_main_a_14 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2018-12-18 22:31:00,944 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-18 22:31:01,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 53 [2018-12-18 22:31:01,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 66 [2018-12-18 22:31:01,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:01,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2018-12-18 22:31:01,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:01,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-18 22:31:01,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 54 [2018-12-18 22:31:01,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2018-12-18 22:31:01,459 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:01,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:01,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 46 [2018-12-18 22:31:01,546 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:01,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-18 22:31:01,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-18 22:31:01,694 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2018-12-18 22:31:03,933 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:03,933 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_15, main_xold, main_yold]. (let ((.cse0 (select v_main_a_15 main_xold)) (.cse2 (+ main_xold 1))) (and (= 1000 .cse0) (= (let ((.cse1 (store v_main_a_15 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a) (= (select v_main_a_15 .cse2) 0) (= main_x (mod .cse2 256)) (= main_y (mod (+ main_xold 2) 256)))) [2018-12-18 22:31:03,934 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_8, v_prenex_7]. (let ((.cse0 (select main_a main_x)) (.cse10 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse3 (select main_a main_y)) (.cse7 (= main_x (mod main_x 256))) (.cse8 (= 1000 .cse10)) (.cse9 (= .cse0 .cse10))) (or (let ((.cse1 (select main_a v_prenex_8)) (.cse2 (+ v_prenex_8 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_8 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= .cse4 1000) (= 0 (select main_a .cse5)) (= main_x (mod .cse5 256)) (= .cse3 (select main_a main_yold)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 .cse7 (= .cse3 (select main_a v_prenex_7)) .cse8 .cse9) (and .cse6 (= .cse3 .cse10) .cse7 .cse8 .cse9)))) [2018-12-18 22:31:04,260 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-18 22:31:04,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 72 [2018-12-18 22:31:04,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,565 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-12-18 22:31:04,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 100 [2018-12-18 22:31:04,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-12-18 22:31:04,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:04,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 93 [2018-12-18 22:31:04,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 122 [2018-12-18 22:31:05,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 167 [2018-12-18 22:31:05,134 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 125 [2018-12-18 22:31:05,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 164 [2018-12-18 22:31:05,292 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,372 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-18 22:31:05,546 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2018-12-18 22:31:07,744 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:07,745 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_16, main_xold, main_yold, v_prenex_9, v_subst_1]. (or (let ((.cse1 (select v_main_a_16 (+ main_xold (- 1)))) (.cse2 (mod (+ main_xold 1) 256)) (.cse0 (select v_main_a_16 main_xold))) (and (= .cse0 .cse1) (= main_xold (mod main_xold 256)) (= 1000 .cse1) (= main_x .cse2) (= (let ((.cse3 (store v_main_a_16 main_x .cse0))) (store .cse3 (mod (+ .cse2 1) 256) (select .cse3 main_yold))) main_a))) (let ((.cse8 (+ v_subst_1 1))) (let ((.cse7 (mod .cse8 256))) (let ((.cse5 (select v_prenex_9 .cse7)) (.cse4 (select v_prenex_9 v_subst_1))) (and (= .cse4 .cse5) (= (let ((.cse6 (store v_prenex_9 main_x .cse5))) (store .cse6 (mod (+ (mod (+ v_subst_1 2) 256) 1) 256) (select .cse6 main_yold))) main_a) (= .cse4 1000) (= main_x (mod (+ .cse7 1) 256)) (= 0 (select v_prenex_9 .cse8))))))) [2018-12-18 22:31:07,745 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1, main_yold, v_prenex_11, main_xold, v_prenex_10]. (let ((.cse4 (select main_a main_x))) (or (let ((.cse3 (+ v_subst_1 1))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (select main_a v_subst_1)) (.cse2 (select main_a .cse0))) (and (= main_x (mod (+ .cse0 1) 256)) (= .cse1 .cse2) (= (select main_a .cse3) 0) (= .cse1 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= .cse4 .cse2))))) (let ((.cse8 (+ v_prenex_11 1))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (select main_a v_prenex_11)) (.cse5 (select main_a .cse6))) (and (= .cse5 (select main_a (mod (+ (mod (+ v_prenex_11 2) 256) 1) 256))) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse5) (= .cse7 1000) (= (select main_a .cse8) 0) (= .cse4 .cse5))))) (let ((.cse9 (select main_a main_xold)) (.cse11 (mod (+ main_xold 1) 256)) (.cse10 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse9 .cse10) (= .cse4 .cse9) (= main_x .cse11) (= (select main_a (mod (+ .cse11 1) 256)) (select main_a v_prenex_10)) (= 1000 .cse10))))) [2018-12-18 22:31:08,017 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-12-18 22:31:08,097 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-18 22:31:10,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2018-12-18 22:31:12,150 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} is UNKNOWN [2018-12-18 22:31:12,186 INFO L273 TraceCheckUtils]: 3: Hoare triple {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} assume a[x] == 0; {110#false} is VALID [2018-12-18 22:31:12,187 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-18 22:31:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:31:12,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:31:14,332 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-18 22:31:14,333 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2018-12-18 22:31:14,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {135#(not (= (select main_a main_x) 0))} is VALID [2018-12-18 22:31:14,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2018-12-18 22:31:14,341 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2018-12-18 22:31:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-18 22:31:14,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:31:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-18 22:31:14,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:31:14,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-18 22:31:14,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:31:14,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-18 22:31:18,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:18,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-18 22:31:18,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-18 22:31:18,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-18 22:31:18,471 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-18 22:31:30,213 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-12-18 22:31:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:34,399 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-12-18 22:31:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-18 22:31:34,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-18 22:31:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:31:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 22:31:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-18 22:31:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 22:31:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-18 22:31:34,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2018-12-18 22:31:37,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 10 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:37,829 INFO L225 Difference]: With dead ends: 10 [2018-12-18 22:31:37,829 INFO L226 Difference]: Without dead ends: 8 [2018-12-18 22:31:37,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-18 22:31:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-18 22:31:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-18 22:31:37,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:31:37,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-18 22:31:37,858 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 22:31:37,859 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 22:31:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:37,860 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 22:31:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 22:31:37,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:37,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:37,861 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 22:31:37,862 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 22:31:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:37,863 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 22:31:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 22:31:37,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:37,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:37,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:31:37,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:31:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 22:31:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-18 22:31:37,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-18 22:31:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:31:37,865 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-18 22:31:37,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-18 22:31:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 22:31:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-18 22:31:37,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:31:37,865 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-18 22:31:37,866 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:31:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:31:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2018-12-18 22:31:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:31:37,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:37,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 22:31:37,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:37,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:31:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:38,455 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2018-12-18 22:31:38,562 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2018-12-18 22:31:38,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} is VALID [2018-12-18 22:31:38,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-18 22:31:38,574 INFO L273 TraceCheckUtils]: 3: Hoare triple {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} is VALID [2018-12-18 22:31:38,576 INFO L273 TraceCheckUtils]: 4: Hoare triple {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {197#(= (select main_a main_y) 1000)} is VALID [2018-12-18 22:31:38,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#(= (select main_a main_y) 1000)} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2018-12-18 22:31:38,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2018-12-18 22:31:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:31:38,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:31:38,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:31:38,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 22:31:38,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 22:31:38,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:31:38,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:31:38,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-18 22:31:38,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-18 22:31:38,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-18 22:31:38,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 22:31:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:38,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:31:38,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-18 22:31:38,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:38,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:38,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-18 22:31:38,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:38,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:38,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:38,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-18 22:31:38,906 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:38,906 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_19]. (and (= main_y (+ main_x 1)) (= (store (store v_main_a_19 main_x 1000) main_y 0) main_a)) [2018-12-18 22:31:38,906 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-18 22:31:39,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2018-12-18 22:31:39,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-12-18 22:31:39,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:39,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:39,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-12-18 22:31:39,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:39,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2018-12-18 22:31:39,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:39,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:39,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-18 22:31:39,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2018-12-18 22:31:41,329 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:41,330 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_20, main_yold]. (let ((.cse1 (select v_main_a_20 (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= (select v_main_a_20 main_yold) 0) (= (let ((.cse0 (store v_main_a_20 main_x .cse1))) (store .cse0 main_y (select .cse0 main_yold))) main_a) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 1000))) [2018-12-18 22:31:41,330 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2018-12-18 22:31:41,718 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-18 22:31:41,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2018-12-18 22:31:41,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2018-12-18 22:31:41,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:41,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:41,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:41,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,032 INFO L683 Elim1Store]: detected equality via solver [2018-12-18 22:31:42,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 148 [2018-12-18 22:31:42,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:42,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 136 [2018-12-18 22:31:42,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:42,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:42,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:31:42,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2018-12-18 22:31:44,318 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:44,319 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_21, v_subst_2, v_prenex_12, main_xold]. (or (let ((.cse5 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_21 v_subst_2)) (.cse4 (select v_main_a_21 (+ v_subst_2 (- 1)))) (.cse3 (select v_main_a_21 .cse5)) (.cse1 (mod (+ v_subst_2 1) 256))) (and (= 0 .cse0) (= (select v_main_a_21 .cse1) .cse0) (= main_a (let ((.cse2 (store v_main_a_21 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1)))) (= 1000 .cse4) (= .cse4 .cse3) (= main_x (mod (+ .cse5 1) 256)) (= (mod (+ .cse1 1) 256) main_y)))) (let ((.cse8 (select v_prenex_12 main_xold)) (.cse9 (select v_prenex_12 (+ main_xold (- 1)))) (.cse7 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= (let ((.cse6 (store v_prenex_12 main_x .cse8))) (store .cse6 main_y (select .cse6 .cse7))) main_a) (= .cse8 .cse9) (= .cse9 1000) (= main_x .cse7) (= .cse9 (select v_prenex_12 .cse7)) (= main_y (mod (+ .cse7 1) 256))))) [2018-12-18 22:31:44,319 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, main_xold]. (or (let ((.cse3 (mod v_subst_2 256))) (let ((.cse2 (mod (+ v_subst_2 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a .cse3))) (and (= .cse0 1000) (= (select main_a main_y) .cse1) (= 0 (select main_a v_subst_2)) (= (mod (+ .cse2 1) 256) main_y) (= main_x .cse2) (= .cse0 .cse1) (= (select main_a (mod (+ .cse3 1) 256)) .cse1)))) (let ((.cse6 (mod (+ main_xold 1) 256))) (let ((.cse5 (select main_a (+ main_xold (- 1)))) (.cse4 (select main_a main_xold)) (.cse7 (mod (+ .cse6 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse4 .cse5) (= (select main_a main_x) .cse4) (= main_x .cse6) (= main_y .cse7) (= 1000 .cse5) (= .cse4 (select main_a .cse7)))))) [2018-12-18 22:31:45,224 WARN L181 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-12-18 22:31:45,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 161 [2018-12-18 22:31:45,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 159 [2018-12-18 22:31:45,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:45,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:45,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,759 INFO L683 Elim1Store]: detected equality via solver [2018-12-18 22:31:45,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 270 [2018-12-18 22:31:45,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:45,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 192 [2018-12-18 22:31:45,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:45,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:46,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:31:46,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2018-12-18 22:31:48,130 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:48,131 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_22, v_subst_2, v_prenex_13, v_subst_3]. (or (let ((.cse4 (mod v_subst_2 256)) (.cse2 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (mod (+ .cse2 1) 256)) (.cse3 (select v_main_a_22 (+ v_subst_2 (- 1)))) (.cse5 (select v_main_a_22 .cse4))) (and (= (let ((.cse0 (store v_main_a_22 main_x (select v_main_a_22 .cse2)))) (store .cse0 main_y (select .cse0 .cse1))) main_a) (= (select v_main_a_22 v_subst_2) 0) (= 1000 .cse3) (= (mod (+ .cse1 1) 256) main_y) (= (select v_main_a_22 (mod (+ .cse4 1) 256)) .cse5) (= .cse1 main_x) (= (select v_main_a_22 .cse1) .cse5) (= .cse3 .cse5)))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse7 (select v_prenex_13 (+ v_subst_3 (- 1)))) (.cse9 (select v_prenex_13 .cse11)) (.cse10 (select v_prenex_13 v_subst_3)) (.cse6 (mod (+ .cse11 1) 256))) (and (= .cse6 main_x) (= .cse7 1000) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse8 (store v_prenex_13 main_x .cse9))) (store .cse8 main_y (select .cse8 .cse6))) main_a) (= .cse7 .cse10) (= .cse10 .cse9) (= (select v_prenex_13 .cse6) .cse10) (= main_y (mod (+ .cse6 1) 256)))))) [2018-12-18 22:31:48,131 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_3, v_subst_2]. (let ((.cse3 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_3 1) 256))) (let ((.cse0 (mod (+ .cse4 1) 256)) (.cse2 (select main_a .cse4)) (.cse1 (select main_a v_subst_3))) (and (= .cse0 main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= .cse1 .cse2) (= main_y (mod (+ .cse0 1) 256)) (= .cse3 .cse2) (= (select main_a .cse0) .cse2) (= .cse1 1000)))) (let ((.cse9 (mod v_subst_2 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse5 (select main_a (+ v_subst_2 (- 1)))) (.cse7 (select main_a (mod (+ .cse9 1) 256))) (.cse8 (select main_a .cse9))) (and (= .cse5 1000) (= (mod (+ .cse6 1) 256) main_y) (= .cse7 .cse3) (= .cse6 main_x) (= .cse7 (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= .cse5 .cse8) (= .cse7 .cse8)))))) [2018-12-18 22:31:48,744 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-18 22:31:52,565 WARN L181 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2018-12-18 22:31:52,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 296 [2018-12-18 22:31:52,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:52,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 212 [2018-12-18 22:31:52,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:52,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:54,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:54,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:54,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:54,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,338 INFO L303 Elim1Store]: Index analysis took 666 ms [2018-12-18 22:31:55,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 394 [2018-12-18 22:31:55,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:55,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 319 [2018-12-18 22:31:55,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:55,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:55,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. [2018-12-18 22:31:55,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2018-12-18 22:31:58,039 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:58,040 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_23, v_subst_2, v_prenex_14, v_subst_3]. (or (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse7 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_23 .cse7)) (.cse2 (select v_main_a_23 (mod (+ .cse7 1) 256))) (.cse3 (mod (+ .cse6 1) 256)) (.cse4 (select v_main_a_23 .cse6)) (.cse1 (select v_main_a_23 (+ v_subst_2 (- 1))))) (and (= .cse0 .cse1) (= .cse2 (select v_main_a_23 .cse3)) (= .cse4 .cse2) (= 0 (select v_main_a_23 v_subst_2)) (= .cse0 .cse2) (= .cse3 main_x) (= main_y (mod (+ .cse3 1) 256)) (= (let ((.cse5 (store v_main_a_23 main_x .cse4))) (store .cse5 main_y (select .cse5 .cse3))) main_a) (= .cse1 1000)))) (let ((.cse14 (mod (+ v_subst_3 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse10 (select v_prenex_14 v_subst_3)) (.cse8 (mod (+ .cse13 1) 256)) (.cse9 (select v_prenex_14 .cse14)) (.cse12 (select v_prenex_14 .cse13))) (and (= main_y (mod (+ .cse8 1) 256)) (= .cse9 .cse10) (= 1000 (select v_prenex_14 (+ v_subst_3 (- 1)))) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse11 (store v_prenex_14 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse8))) main_a) (= main_x .cse8) (= 1000 .cse10) (= (select v_prenex_14 .cse8) .cse9) (= .cse9 .cse12)))))) [2018-12-18 22:31:58,040 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse5 (select main_a main_x))) (or (let ((.cse7 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (let ((.cse6 (mod v_subst_2 256)) (.cse4 (mod (+ .cse7 1) 256))) (let ((.cse2 (mod (+ .cse4 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a (mod (+ .cse6 1) 256))) (.cse3 (select main_a .cse7))) (and (= .cse0 1000) (= .cse1 1000) (= (select main_a .cse2) .cse3) (= .cse4 main_x) (= main_y .cse2) (= 0 (select main_a v_subst_2)) (= .cse5 .cse3) (= .cse0 (select main_a .cse6)) (= .cse1 .cse3))))) (let ((.cse13 (mod (+ v_subst_3 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse9 (select main_a .cse12)) (.cse11 (select main_a .cse13)) (.cse8 (mod (+ .cse12 1) 256)) (.cse10 (select main_a v_subst_3))) (and (= main_y (mod (+ .cse8 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= .cse9 .cse5) (= v_subst_3 (mod v_subst_3 256)) (= .cse9 (select main_a main_y)) (= .cse10 .cse11) (= .cse9 .cse11) (= main_x .cse8) (= .cse10 1000))))))) [2018-12-18 22:32:05,214 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-18 22:32:05,275 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-18 22:32:07,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2018-12-18 22:32:09,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2018-12-18 22:32:11,306 INFO L273 TraceCheckUtils]: 3: Hoare triple {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} is UNKNOWN [2018-12-18 22:32:13,320 INFO L273 TraceCheckUtils]: 4: Hoare triple {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} is UNKNOWN [2018-12-18 22:32:13,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} assume a[x] == 0; {192#false} is VALID [2018-12-18 22:32:13,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2018-12-18 22:32:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:32:13,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:32:23,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2018-12-18 22:32:23,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2018-12-18 22:32:23,491 INFO L273 TraceCheckUtils]: 4: Hoare triple {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2018-12-18 22:32:23,620 INFO L273 TraceCheckUtils]: 3: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} is VALID [2018-12-18 22:32:23,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-18 22:32:23,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-18 22:32:23,848 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-18 22:32:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-18 22:32:23,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:32:23,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2018-12-18 22:32:23,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:32:23,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-18 22:32:23,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:32:23,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-12-18 22:32:31,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 11 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-12-18 22:32:31,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-18 22:32:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-18 22:32:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=134, Unknown=3, NotChecked=0, Total=210 [2018-12-18 22:32:31,139 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2018-12-18 22:33:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:33:06,829 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-18 22:33:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-18 22:33:06,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-18 22:33:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:33:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 22:33:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-12-18 22:33:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 22:33:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-12-18 22:33:06,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2018-12-18 22:33:13,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 15 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-12-18 22:33:13,964 INFO L225 Difference]: With dead ends: 15 [2018-12-18 22:33:13,964 INFO L226 Difference]: Without dead ends: 12 [2018-12-18 22:33:13,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=73, Invalid=134, Unknown=3, NotChecked=0, Total=210 [2018-12-18 22:33:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-18 22:33:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-18 22:33:14,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:33:14,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-12-18 22:33:14,030 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-18 22:33:14,030 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-18 22:33:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:33:14,032 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-18 22:33:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-18 22:33:14,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:33:14,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:33:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-18 22:33:14,033 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-18 22:33:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:33:14,034 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-18 22:33:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-18 22:33:14,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:33:14,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:33:14,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:33:14,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:33:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 22:33:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-18 22:33:14,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2018-12-18 22:33:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:33:14,036 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-18 22:33:14,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-18 22:33:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-18 22:33:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-18 22:33:14,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:33:14,037 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-18 22:33:14,037 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:33:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:33:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2018-12-18 22:33:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:33:14,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:33:14,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 22:33:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:33:14,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:33:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:33:15,097 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2018-12-18 22:33:15,413 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 [2018-12-18 22:33:15,418 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 [2018-12-18 22:33:15,427 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 [2018-12-18 22:33:15,428 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 [2018-12-18 22:33:15,430 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 [2018-12-18 22:33:15,431 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 [2018-12-18 22:33:15,432 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 [2018-12-18 22:33:15,433 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 [2018-12-18 22:33:15,434 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 [2018-12-18 22:33:15,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(not (= 0 (select main_a main_x)))} assume a[x] == 0; {314#false} is VALID [2018-12-18 22:33:15,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2018-12-18 22:33:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-18 22:33:15,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:33:15,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:33:15,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 22:33:15,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 22:33:15,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:33:15,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:33:15,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:33:15,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:33:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:33:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:33:18,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:33:18,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-18 22:33:18,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-18 22:33:18,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:18,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:18,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:18,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-18 22:33:18,362 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:33:18,362 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_28]. (and (= (store (store v_main_a_28 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2018-12-18 22:33:18,362 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-18 22:33:18,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2018-12-18 22:33:18,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-12-18 22:33:18,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:18,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:18,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-12-18 22:33:18,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:18,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2018-12-18 22:33:18,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:18,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:18,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-18 22:33:18,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2018-12-18 22:33:20,682 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:33:20,683 WARN L384 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))) [2018-12-18 22:33:20,683 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2018-12-18 22:33:21,010 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-18 22:33:21,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2018-12-18 22:33:21,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2018-12-18 22:33:21,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:21,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:21,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-18 22:33:21,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,196 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 [2018-12-18 22:33:21,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:21,226 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 [2018-12-18 22:33:21,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:21,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:21,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:33:21,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2018-12-18 22:33:23,395 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:33:23,396 WARN L384 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))))) [2018-12-18 22:33:23,396 WARN L385 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)))))) [2018-12-18 22:33:26,629 WARN L181 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-12-18 22:33:26,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-18 22:33:26,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-18 22:33:26,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,744 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-12-18 22:33:26,745 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 [2018-12-18 22:33:26,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:26,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,003 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 [2018-12-18 22:33:27,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:27,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:27,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,471 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 [2018-12-18 22:33:27,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:27,541 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 [2018-12-18 22:33:27,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:27,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:27,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. [2018-12-18 22:33:27,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2018-12-18 22:33:29,844 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:33:29,845 WARN L384 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)))))) [2018-12-18 22:33:29,845 WARN L385 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))))))) [2018-12-18 22:33:30,744 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-18 22:33:33,443 WARN L181 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2018-12-18 22:33:33,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-18 22:33:33,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:33,527 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 [2018-12-18 22:33:33,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:33,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:34,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,334 INFO L303 Elim1Store]: Index analysis took 371 ms [2018-12-18 22:33:35,335 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 [2018-12-18 22:33:35,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:35,406 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 [2018-12-18 22:33:35,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:35,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:33:36,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:33:36,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2018-12-18 22:33:38,578 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:33:38,578 WARN L384 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)))))) [2018-12-18 22:33:38,579 WARN L385 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))))))) [2018-12-18 22:33:48,262 WARN L181 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 64 [2018-12-18 22:33:55,474 WARN L181 SmtUtils]: Spent 7.12 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-12-18 22:33:55,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,668 INFO L303 Elim1Store]: Index analysis took 182 ms [2018-12-18 22:33:55,669 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 [2018-12-18 22:33:55,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:33:55,728 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 [2018-12-18 22:33:55,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:33:56,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:34:00,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:00,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:01,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,156 INFO L303 Elim1Store]: Index analysis took 1679 ms [2018-12-18 22:34:02,158 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 [2018-12-18 22:34:02,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:02,437 INFO L303 Elim1Store]: Index analysis took 218 ms [2018-12-18 22:34:02,438 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 [2018-12-18 22:34:02,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:34:03,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:34:04,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:34:04,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2018-12-18 22:34:06,776 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:34:06,777 WARN L384 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)))))))) [2018-12-18 22:34:06,777 WARN L385 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)))))))) [2018-12-18 22:34:19,113 WARN L181 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 72 [2018-12-18 22:34:38,720 WARN L181 SmtUtils]: Spent 19.52 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-18 22:34:38,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:39,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:40,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:41,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:41,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:41,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:41,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:41,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:41,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:41,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,449 INFO L303 Elim1Store]: Index analysis took 3712 ms [2018-12-18 22:34:42,451 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 [2018-12-18 22:34:42,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:42,755 INFO L303 Elim1Store]: Index analysis took 210 ms [2018-12-18 22:34:42,757 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 [2018-12-18 22:34:42,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:34:45,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:34:59,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,562 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-12-18 22:34:59,563 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 [2018-12-18 22:34:59,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:34:59,683 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 [2018-12-18 22:34:59,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:35:00,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:35:02,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:35:02,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:547, output treesize:445 [2018-12-18 22:35:04,529 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:35:04,529 WARN L384 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)))))))))) [2018-12-18 22:35:04,530 WARN L385 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))))))))))) [2018-12-18 22:35:33,713 WARN L181 SmtUtils]: Spent 5.48 s on a formula simplification that was a NOOP. DAG size: 81 [2018-12-18 22:35:56,224 WARN L181 SmtUtils]: Spent 21.94 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-12-18 22:35:56,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:56,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:57,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:58,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:35:59,823 INFO L303 Elim1Store]: Index analysis took 3584 ms [2018-12-18 22:35:59,825 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 [2018-12-18 22:36:00,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:00,168 INFO L303 Elim1Store]: Index analysis took 279 ms [2018-12-18 22:36:00,170 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 [2018-12-18 22:36:00,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:36:04,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:36:39,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,660 INFO L303 Elim1Store]: Index analysis took 339 ms [2018-12-18 22:36:39,662 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 [2018-12-18 22:36:39,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:36:39,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 863 [2018-12-18 22:36:39,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:36:40,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:36:43,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:36:43,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:689, output treesize:557 [2018-12-18 22:36:45,521 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:36:45,522 WARN L384 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)))))))))) [2018-12-18 22:36:45,522 WARN L385 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)))))))))) [2018-12-18 22:37:18,378 WARN L181 SmtUtils]: Spent 4.52 s on a formula simplification that was a NOOP. DAG size: 89 [2018-12-18 22:37:55,194 WARN L181 SmtUtils]: Spent 36.62 s on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-12-18 22:37:55,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:55,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:56,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:57,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:57,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:57,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:57,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:57,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:57,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:58,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:58,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:58,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:58,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:58,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:58,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:58,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:59,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:59,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:37:59,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:00,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:01,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:01,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:01,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:01,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:01,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:02,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:02,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:02,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:02,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:02,576 INFO L303 Elim1Store]: Index analysis took 7360 ms [2018-12-18 22:38:02,577 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 [2018-12-18 22:38:03,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:03,271 INFO L303 Elim1Store]: Index analysis took 595 ms [2018-12-18 22:38:03,273 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 [2018-12-18 22:38:03,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-18 22:38:15,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:38:52,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,684 INFO L303 Elim1Store]: Index analysis took 676 ms [2018-12-18 22:38:52,686 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 [2018-12-18 22:38:52,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:38:52,811 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 [2018-12-18 22:38:52,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:38:53,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:39:02,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-18 22:39:02,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:841, output treesize:653 [2018-12-18 22:39:04,843 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:39:04,843 WARN L384 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)))))))))) [2018-12-18 22:39:04,844 WARN L385 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))))))))))) [2018-12-18 22:39:06,891 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_subst_4 Int)) (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse6 1) 256))) (let ((.cse4 (mod (+ .cse8 1) 256))) (let ((.cse3 (mod (+ .cse4 1) 256))) (let ((.cse9 (mod (+ .cse3 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse0 (mod (+ .cse10 1) 256)) (.cse1 (select c_main_a .cse10)) (.cse2 (select c_main_a .cse9)) (.cse5 (select c_main_a .cse8)) (.cse7 (select c_main_a (+ v_subst_4 (- 1))))) (and (= c_main_y (mod (+ .cse0 1) 256)) (= c_main_x .cse0) (= (select c_main_a c_main_y) .cse1) (= 1000 .cse2) (= (select c_main_a c_main_x) .cse1) (= (select c_main_a .cse3) .cse2) (= .cse1 .cse2) (= (select c_main_a .cse4) .cse5) (= (select c_main_a .cse6) .cse5) (= 1000 .cse5) (= 0 (select c_main_a v_subst_4)) (= 1000 .cse7) (= (select c_main_a (mod v_subst_4 256)) .cse7)))))))))) (exists ((v_subst_5 Int)) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse20 (mod (+ .cse18 1) 256))) (let ((.cse23 (mod (+ .cse20 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse22 1) 256))) (let ((.cse11 (select c_main_a .cse23)) (.cse14 (mod (+ .cse21 1) 256)) (.cse16 (select c_main_a .cse22)) (.cse12 (select c_main_a .cse21)) (.cse15 (select c_main_a v_subst_5)) (.cse13 (select c_main_a .cse20)) (.cse17 (select c_main_a .cse19))) (and (= 1000 .cse11) (= (select c_main_a c_main_y) .cse12) (= (select c_main_a c_main_x) .cse12) (= .cse13 .cse11) (= .cse14 c_main_x) (= .cse15 (select c_main_a (+ v_subst_5 (- 1)))) (= .cse16 1000) (= c_main_y (mod (+ .cse14 1) 256)) (= .cse16 .cse12) (= .cse15 .cse17) (= .cse13 (select c_main_a .cse18)) (= v_subst_5 (mod v_subst_5 256)) (= .cse17 1000))))))))))) is different from false [2018-12-18 22:39:06,957 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 [2018-12-18 22:39:07,143 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 [2018-12-18 22:39:09,155 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 [2018-12-18 22:39:11,164 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 [2018-12-18 22:39:13,173 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 [2018-12-18 22:39:15,183 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 [2018-12-18 22:39:17,202 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 [2018-12-18 22:39:19,218 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 [2018-12-18 22:39:21,233 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 [2018-12-18 22:39:21,241 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 [2018-12-18 22:39:21,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2018-12-18 22:39:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 13 times theorem prover too weak. 0 trivial. 8 not checked. [2018-12-18 22:39:21,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:39:47,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {314#false} is VALID [2018-12-18 22:39:47,476 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 [2018-12-18 22:39:47,477 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 [2018-12-18 22:39:47,499 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 [2018-12-18 22:39:48,753 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 [2018-12-18 22:39:49,000 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 [2018-12-18 22:39:49,174 INFO L273 TraceCheckUtils]: 4: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-18 22:39:49,359 INFO L273 TraceCheckUtils]: 3: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-18 22:39:50,257 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 [2018-12-18 22:39:50,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-18 22:39:50,395 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 [2018-12-18 22:39:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-18 22:39:50,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:39:50,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 4] total 19 [2018-12-18 22:39:50,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:39:50,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2018-12-18 22:39:50,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:39:50,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-12-18 22:40:06,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 11 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2018-12-18 22:40:06,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-18 22:40:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-18 22:40:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=201, Unknown=30, NotChecked=34, Total=380 [2018-12-18 22:40:06,534 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2018-12-18 22:43:21,497 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select c_main_a c_main_y))) (and (= (select c_main_a c_main_x) .cse0) (or (exists ((v_subst_4 Int)) (let ((.cse7 (mod (+ v_subst_4 1) 256))) (let ((.cse9 (mod (+ .cse7 1) 256))) (let ((.cse5 (mod (+ .cse9 1) 256))) (let ((.cse4 (mod (+ .cse5 1) 256))) (let ((.cse10 (mod (+ .cse4 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse1 (mod (+ .cse11 1) 256)) (.cse2 (select c_main_a .cse11)) (.cse3 (select c_main_a .cse10)) (.cse6 (select c_main_a .cse9)) (.cse8 (select c_main_a (+ v_subst_4 (- 1))))) (and (= c_main_y (mod (+ .cse1 1) 256)) (= c_main_x .cse1) (= (select c_main_a c_main_y) .cse2) (= 1000 .cse3) (= (select c_main_a c_main_x) .cse2) (= (select c_main_a .cse4) .cse3) (= .cse2 .cse3) (= (select c_main_a .cse5) .cse6) (= (select c_main_a .cse7) .cse6) (= 1000 .cse6) (= 0 (select c_main_a v_subst_4)) (= 1000 .cse8) (= (select c_main_a (mod v_subst_4 256)) .cse8)))))))))) (exists ((v_subst_5 Int)) (let ((.cse20 (mod (+ v_subst_5 1) 256))) (let ((.cse19 (mod (+ .cse20 1) 256))) (let ((.cse21 (mod (+ .cse19 1) 256))) (let ((.cse24 (mod (+ .cse21 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse12 (select c_main_a .cse24)) (.cse15 (mod (+ .cse22 1) 256)) (.cse17 (select c_main_a .cse23)) (.cse13 (select c_main_a .cse22)) (.cse16 (select c_main_a v_subst_5)) (.cse14 (select c_main_a .cse21)) (.cse18 (select c_main_a .cse20))) (and (= 1000 .cse12) (= (select c_main_a c_main_y) .cse13) (= (select c_main_a c_main_x) .cse13) (= .cse14 .cse12) (= .cse15 c_main_x) (= .cse16 (select c_main_a (+ v_subst_5 (- 1)))) (= .cse17 1000) (= c_main_y (mod (+ .cse15 1) 256)) (= .cse17 .cse13) (= .cse16 .cse18) (= .cse14 (select c_main_a .cse19)) (= v_subst_5 (mod v_subst_5 256)) (= .cse18 1000))))))))))) (not (= 0 .cse0)))) is different from false [2018-12-18 22:43:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:43:47,654 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-18 22:43:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-18 22:43:47,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2018-12-18 22:43:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:43:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-18 22:43:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-18 22:43:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-18 22:43:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-18 22:43:47,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 14 transitions. [2018-12-18 22:44:03,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 7 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-12-18 22:44:03,443 INFO L225 Difference]: With dead ends: 13 [2018-12-18 22:44:03,444 INFO L226 Difference]: Without dead ends: 0 [2018-12-18 22:44:03,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 105.9s TimeCoverageRelationStatistics Valid=117, Invalid=202, Unknown=31, NotChecked=70, Total=420 [2018-12-18 22:44:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-18 22:44:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-18 22:44:03,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:44:03,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-18 22:44:03,445 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-18 22:44:03,445 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-18 22:44:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:44:03,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-18 22:44:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-18 22:44:03,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:44:03,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:44:03,446 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-18 22:44:03,446 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-18 22:44:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:44:03,446 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-18 22:44:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-18 22:44:03,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:44:03,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:44:03,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:44:03,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:44:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-18 22:44:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-18 22:44:03,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-12-18 22:44:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:44:03,447 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-18 22:44:03,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-18 22:44:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-18 22:44:03,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:44:03,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-18 22:44:07,241 WARN L181 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 354 DAG size of output: 35 [2018-12-18 22:44:07,250 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 9 30) no Hoare annotation was computed. [2018-12-18 22:44:07,250 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-18 22:44:07,250 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 9 30) no Hoare annotation was computed. [2018-12-18 22:44:07,251 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 30) no Hoare annotation was computed. [2018-12-18 22:44:07,251 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 28) no Hoare annotation was computed. [2018-12-18 22:44:07,251 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)))))) [2018-12-18 22:44:07,253 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-12-18 22:44:09,261 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-12-18 22:44:09,261 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-12-18 22:44:09,261 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-12-18 22:44:09,261 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-12-18 22:44:09,261 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-12-18 22:44:09,261 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. [2018-12-18 22:44:09,268 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:44:09 BoogieIcfgContainer [2018-12-18 22:44:09,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:44:09,269 INFO L168 Benchmark]: Toolchain (without parser) took 809166.85 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -590.3 MB). Peak memory consumption was 434.7 MB. Max. memory is 7.1 GB. [2018-12-18 22:44:09,270 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:44:09,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:44:09,270 INFO L168 Benchmark]: Boogie Preprocessor took 25.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:44:09,271 INFO L168 Benchmark]: RCFGBuilder took 405.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-18 22:44:09,271 INFO L168 Benchmark]: TraceAbstraction took 808693.14 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -611.4 MB). Peak memory consumption was 413.6 MB. Max. memory is 7.1 GB. [2018-12-18 22:44:09,273 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 405.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 808693.14 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -611.4 MB). Peak memory consumption was 413.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((a[x] == 1000 && a[y] == 0) && y == x + 1) || (a[x] == a[y] && !(0 == a[y]))) || (exists main_yold : int :: ((((main_yold % 256 == x && 0 == a[main_yold]) && y == (main_yold + 1) % 256) && a[y] == a[main_yold]) && a[x] == a[main_yold + -1]) && 1000 == a[main_yold + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 806.6s OverallTime, 5 OverallIterations, 8 TraceHistogramMax, 305.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 81 SolverSat, 9 SolverUnsat, 55 SolverUnknown, 0 SolverNotchecked, 115.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 122.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s 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, 669 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 2799 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 460.7s 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...