java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:25:13,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:25:13,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:25:13,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:25:13,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:25:13,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:25:13,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:25:13,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:25:13,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:25:13,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:25:13,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:25:13,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:25:13,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:25:13,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:25:13,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:25:13,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:25:13,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:25:13,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:25:13,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:25:13,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:25:13,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:25:13,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:25:13,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:25:13,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:25:13,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:25:13,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:25:13,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:25:13,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:25:13,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:25:13,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:25:13,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:25:13,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:25:13,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:25:13,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:25:13,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:25:13,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:25:13,617 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:25:13,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:25:13,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:25:13,634 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:25:13,634 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:25:13,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:25:13,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:25:13,635 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:25:13,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:25:13,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:25:13,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:25:13,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:25:13,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:25:13,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:25:13,637 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:25:13,637 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:25:13,637 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:25:13,637 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:25:13,638 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:25:13,638 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:25:13,638 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:25:13,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:25:13,639 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:25:13,639 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:25:13,639 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:25:13,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:25:13,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:25:13,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:25:13,640 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:25:13,640 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:25:13,640 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:25:13,640 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:25:13,640 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:25:13,641 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:25:13,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:25:13,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:25:13,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:25:13,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:25:13,712 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:25:13,713 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-23 10:25:13,784 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab90daae/06d984af0f44479d806129798eab1406/FLAGcd2d5b537 [2018-11-23 10:25:14,215 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:25:14,216 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-23 10:25:14,228 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab90daae/06d984af0f44479d806129798eab1406/FLAGcd2d5b537 [2018-11-23 10:25:14,595 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab90daae/06d984af0f44479d806129798eab1406 [2018-11-23 10:25:14,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:25:14,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:25:14,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:14,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:25:14,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:25:14,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:14,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef5bbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14, skipping insertion in model container [2018-11-23 10:25:14,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:14,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:25:14,660 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:25:14,939 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:14,952 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:25:14,979 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:14,998 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:25:14,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14 WrapperNode [2018-11-23 10:25:14,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:15,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:15,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:25:15,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:25:15,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:15,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:25:15,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:25:15,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:25:15,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (1/1) ... [2018-11-23 10:25:15,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:25:15,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:25:15,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:25:15,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:25:15,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (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-11-23 10:25:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:25:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:25:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:25:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:25:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:25:15,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:25:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 10:25:15,196 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 10:25:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:25:15,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:25:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:25:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:25:15,799 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:25:15,799 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:25:15,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:15 BoogieIcfgContainer [2018-11-23 10:25:15,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:25:15,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:25:15,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:25:15,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:25:15,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:25:14" (1/3) ... [2018-11-23 10:25:15,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de1264b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:15, skipping insertion in model container [2018-11-23 10:25:15,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:14" (2/3) ... [2018-11-23 10:25:15,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de1264b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:15, skipping insertion in model container [2018-11-23 10:25:15,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:15" (3/3) ... [2018-11-23 10:25:15,809 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_true-unreach-call_true-termination.i [2018-11-23 10:25:15,818 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:25:15,828 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:25:15,843 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:25:15,875 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:25:15,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:25:15,877 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:25:15,877 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:25:15,878 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:25:15,879 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:25:15,879 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:25:15,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:25:15,879 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:25:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 10:25:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:25:15,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:15,908 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:15,910 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:15,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1754504496, now seen corresponding path program 1 times [2018-11-23 10:25:15,920 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:15,921 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:16,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:16,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 10:25:16,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {34#true} is VALID [2018-11-23 10:25:16,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 10:25:16,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 10:25:16,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret11 := main(); {34#true} is VALID [2018-11-23 10:25:16,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2018-11-23 10:25:16,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {34#true} is VALID [2018-11-23 10:25:16,422 INFO L256 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 10:25:16,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {34#true} is VALID [2018-11-23 10:25:16,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 10:25:16,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:16,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:16,432 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {34#true} #64#return; {35#false} is VALID [2018-11-23 10:25:16,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {35#false} is VALID [2018-11-23 10:25:16,433 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:16,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {35#false} is VALID [2018-11-23 10:25:16,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:16,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:16,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:16,434 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2018-11-23 10:25:16,434 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {35#false} is VALID [2018-11-23 10:25:16,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {35#false} is VALID [2018-11-23 10:25:16,435 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {35#false} is VALID [2018-11-23 10:25:16,435 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:16,435 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {35#false} is VALID [2018-11-23 10:25:16,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:16,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:16,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:16,436 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #68#return; {35#false} is VALID [2018-11-23 10:25:16,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {35#false} is VALID [2018-11-23 10:25:16,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 10:25:16,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 10:25:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:25:16,444 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:16,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:16,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:25:16,456 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:25:16,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:16,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:25:16,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:16,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:25:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:25:16,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:25:16,551 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 10:25:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:16,762 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 10:25:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:25:16,763 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:25:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:25:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 10:25:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:25:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 10:25:16,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-23 10:25:17,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:17,043 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:25:17,044 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 10:25:17,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:25:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 10:25:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 10:25:17,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:17,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 10:25:17,104 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:25:17,104 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:25:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:17,117 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 10:25:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:25:17,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:17,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:17,119 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:25:17,120 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:25:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:17,128 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 10:25:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:25:17,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:17,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:17,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:17,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:25:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 10:25:17,135 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 32 [2018-11-23 10:25:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:17,135 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 10:25:17,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:25:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:25:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:25:17,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:17,138 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:17,138 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:17,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash 614035178, now seen corresponding path program 1 times [2018-11-23 10:25:17,139 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:17,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:17,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:17,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:17,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-23 10:25:17,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {285#true} is VALID [2018-11-23 10:25:17,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-23 10:25:17,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2018-11-23 10:25:17,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret11 := main(); {285#true} is VALID [2018-11-23 10:25:17,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {285#true} is VALID [2018-11-23 10:25:17,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {285#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {308#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:17,753 INFO L256 TraceCheckUtils]: 7: Hoare triple {308#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {308#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:17,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {308#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {315#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {315#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {286#false} is VALID [2018-11-23 10:25:17,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#false} #res := ~ret~0[32:0]; {286#false} is VALID [2018-11-23 10:25:17,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 10:25:17,756 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {286#false} {308#(bvsgt ~N~0 (_ bv1 32))} #64#return; {286#false} is VALID [2018-11-23 10:25:17,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {286#false} is VALID [2018-11-23 10:25:17,757 INFO L256 TraceCheckUtils]: 14: Hoare triple {286#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {286#false} is VALID [2018-11-23 10:25:17,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {286#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {286#false} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {286#false} assume !~bvslt32(~i~0, ~N~0); {286#false} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} #res := ~ret~0[32:0]; {286#false} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 10:25:17,759 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {286#false} {286#false} #66#return; {286#false} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {286#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {286#false} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {286#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {286#false} is VALID [2018-11-23 10:25:17,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {286#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {286#false} is VALID [2018-11-23 10:25:17,760 INFO L256 TraceCheckUtils]: 23: Hoare triple {286#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {286#false} is VALID [2018-11-23 10:25:17,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {286#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {286#false} is VALID [2018-11-23 10:25:17,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {286#false} assume !~bvslt32(~i~0, ~N~0); {286#false} is VALID [2018-11-23 10:25:17,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {286#false} #res := ~ret~0[32:0]; {286#false} is VALID [2018-11-23 10:25:17,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-23 10:25:17,762 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {286#false} {286#false} #68#return; {286#false} is VALID [2018-11-23 10:25:17,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {286#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {286#false} is VALID [2018-11-23 10:25:17,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {286#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {286#false} is VALID [2018-11-23 10:25:17,767 INFO L273 TraceCheckUtils]: 31: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-23 10:25:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:25:17,769 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:17,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:17,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:25:17,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:25:17,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:17,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:25:17,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:17,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:25:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:25:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:25:17,863 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2018-11-23 10:25:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:18,294 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 10:25:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:25:18,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:25:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:25:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 10:25:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:25:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 10:25:18,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2018-11-23 10:25:18,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:18,502 INFO L225 Difference]: With dead ends: 44 [2018-11-23 10:25:18,502 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 10:25:18,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:25:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 10:25:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 10:25:18,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:18,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 10:25:18,525 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 10:25:18,526 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 10:25:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:18,529 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:25:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:25:18,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:18,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:18,531 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 10:25:18,531 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 10:25:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:18,534 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:25:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:25:18,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:18,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:18,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:18,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:25:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 10:25:18,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 32 [2018-11-23 10:25:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:18,539 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 10:25:18,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:25:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 10:25:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 10:25:18,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:18,541 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:18,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:18,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash 435243016, now seen corresponding path program 1 times [2018-11-23 10:25:18,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:18,543 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:18,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:18,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:18,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {535#true} is VALID [2018-11-23 10:25:18,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {535#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {535#true} is VALID [2018-11-23 10:25:18,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-23 10:25:18,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {535#true} {535#true} #60#return; {535#true} is VALID [2018-11-23 10:25:18,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {535#true} call #t~ret11 := main(); {535#true} is VALID [2018-11-23 10:25:18,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {535#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {535#true} is VALID [2018-11-23 10:25:18,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {535#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {558#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:18,945 INFO L256 TraceCheckUtils]: 7: Hoare triple {558#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {558#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:18,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {558#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {565#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:18,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {565#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {565#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:18,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {565#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {572#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:18,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {572#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {536#false} is VALID [2018-11-23 10:25:18,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {536#false} #res := ~ret~0[32:0]; {536#false} is VALID [2018-11-23 10:25:18,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {536#false} assume true; {536#false} is VALID [2018-11-23 10:25:18,954 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {536#false} {558#(bvsgt ~N~0 (_ bv1 32))} #64#return; {536#false} is VALID [2018-11-23 10:25:18,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {536#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {536#false} is VALID [2018-11-23 10:25:18,955 INFO L256 TraceCheckUtils]: 16: Hoare triple {536#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {536#false} is VALID [2018-11-23 10:25:18,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {536#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {536#false} is VALID [2018-11-23 10:25:18,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {536#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {536#false} is VALID [2018-11-23 10:25:18,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {536#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {536#false} is VALID [2018-11-23 10:25:18,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {536#false} assume !~bvslt32(~i~0, ~N~0); {536#false} is VALID [2018-11-23 10:25:18,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {536#false} #res := ~ret~0[32:0]; {536#false} is VALID [2018-11-23 10:25:18,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {536#false} assume true; {536#false} is VALID [2018-11-23 10:25:18,957 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {536#false} {536#false} #66#return; {536#false} is VALID [2018-11-23 10:25:18,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {536#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {536#false} is VALID [2018-11-23 10:25:18,958 INFO L273 TraceCheckUtils]: 25: Hoare triple {536#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {536#false} is VALID [2018-11-23 10:25:18,958 INFO L273 TraceCheckUtils]: 26: Hoare triple {536#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {536#false} is VALID [2018-11-23 10:25:18,959 INFO L256 TraceCheckUtils]: 27: Hoare triple {536#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {536#false} is VALID [2018-11-23 10:25:18,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {536#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {536#false} is VALID [2018-11-23 10:25:18,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {536#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {536#false} is VALID [2018-11-23 10:25:18,960 INFO L273 TraceCheckUtils]: 30: Hoare triple {536#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {536#false} is VALID [2018-11-23 10:25:18,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {536#false} assume !~bvslt32(~i~0, ~N~0); {536#false} is VALID [2018-11-23 10:25:18,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {536#false} #res := ~ret~0[32:0]; {536#false} is VALID [2018-11-23 10:25:18,960 INFO L273 TraceCheckUtils]: 33: Hoare triple {536#false} assume true; {536#false} is VALID [2018-11-23 10:25:18,961 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {536#false} {536#false} #68#return; {536#false} is VALID [2018-11-23 10:25:18,961 INFO L273 TraceCheckUtils]: 35: Hoare triple {536#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {536#false} is VALID [2018-11-23 10:25:18,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {536#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {536#false} is VALID [2018-11-23 10:25:18,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {536#false} assume !false; {536#false} is VALID [2018-11-23 10:25:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 10:25:18,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:19,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {536#false} assume !false; {536#false} is VALID [2018-11-23 10:25:19,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {536#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {536#false} is VALID [2018-11-23 10:25:19,200 INFO L273 TraceCheckUtils]: 35: Hoare triple {536#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {536#false} is VALID [2018-11-23 10:25:19,201 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {535#true} {536#false} #68#return; {536#false} is VALID [2018-11-23 10:25:19,201 INFO L273 TraceCheckUtils]: 33: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-23 10:25:19,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {535#true} #res := ~ret~0[32:0]; {535#true} is VALID [2018-11-23 10:25:19,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {535#true} assume !~bvslt32(~i~0, ~N~0); {535#true} is VALID [2018-11-23 10:25:19,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {535#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {535#true} is VALID [2018-11-23 10:25:19,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {535#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {535#true} is VALID [2018-11-23 10:25:19,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {535#true} is VALID [2018-11-23 10:25:19,203 INFO L256 TraceCheckUtils]: 27: Hoare triple {536#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {535#true} is VALID [2018-11-23 10:25:19,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {536#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {536#false} is VALID [2018-11-23 10:25:19,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {536#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {536#false} is VALID [2018-11-23 10:25:19,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {536#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {536#false} is VALID [2018-11-23 10:25:19,204 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {535#true} {536#false} #66#return; {536#false} is VALID [2018-11-23 10:25:19,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-23 10:25:19,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {535#true} #res := ~ret~0[32:0]; {535#true} is VALID [2018-11-23 10:25:19,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {535#true} assume !~bvslt32(~i~0, ~N~0); {535#true} is VALID [2018-11-23 10:25:19,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {535#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {535#true} is VALID [2018-11-23 10:25:19,206 INFO L273 TraceCheckUtils]: 18: Hoare triple {535#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {535#true} is VALID [2018-11-23 10:25:19,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {535#true} is VALID [2018-11-23 10:25:19,206 INFO L256 TraceCheckUtils]: 16: Hoare triple {536#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {535#true} is VALID [2018-11-23 10:25:19,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {536#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {536#false} is VALID [2018-11-23 10:25:19,221 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {726#(not (bvsgt ~N~0 (_ bv1 32)))} {558#(bvsgt ~N~0 (_ bv1 32))} #64#return; {536#false} is VALID [2018-11-23 10:25:19,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {726#(not (bvsgt ~N~0 (_ bv1 32)))} assume true; {726#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:19,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(not (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {726#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:19,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {736#(or (bvslt sum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !~bvslt32(~i~0, ~N~0); {726#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:19,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {736#(or (bvslt sum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:19,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {740#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {740#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:19,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {740#(or (bvslt (bvadd sum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:19,254 INFO L256 TraceCheckUtils]: 7: Hoare triple {558#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {535#true} is VALID [2018-11-23 10:25:19,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {535#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {558#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:19,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {535#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {535#true} is VALID [2018-11-23 10:25:19,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {535#true} call #t~ret11 := main(); {535#true} is VALID [2018-11-23 10:25:19,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {535#true} {535#true} #60#return; {535#true} is VALID [2018-11-23 10:25:19,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-23 10:25:19,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {535#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {535#true} is VALID [2018-11-23 10:25:19,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {535#true} is VALID [2018-11-23 10:25:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 10:25:19,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:19,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 10:25:19,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 10:25:19,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:19,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:25:19,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:19,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:25:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:25:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:25:19,402 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2018-11-23 10:25:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:19,905 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 10:25:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:25:19,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 10:25:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:25:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 10:25:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:25:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 10:25:19,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2018-11-23 10:25:20,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:20,026 INFO L225 Difference]: With dead ends: 47 [2018-11-23 10:25:20,027 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:25:20,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 10:25:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:25:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 10:25:20,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:20,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 10:25:20,052 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 10:25:20,052 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 10:25:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:20,056 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:25:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:25:20,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:20,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:20,057 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 10:25:20,057 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 10:25:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:20,060 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:25:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:25:20,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:20,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:20,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:20,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:25:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 10:25:20,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 38 [2018-11-23 10:25:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:20,064 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 10:25:20,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:25:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 10:25:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:25:20,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:20,066 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:20,066 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:20,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1564241242, now seen corresponding path program 2 times [2018-11-23 10:25:20,067 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:20,067 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:20,086 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:20,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:25:20,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:20,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:20,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {935#true} call ULTIMATE.init(); {935#true} is VALID [2018-11-23 10:25:20,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {935#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {935#true} is VALID [2018-11-23 10:25:20,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {935#true} assume true; {935#true} is VALID [2018-11-23 10:25:20,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {935#true} {935#true} #60#return; {935#true} is VALID [2018-11-23 10:25:20,499 INFO L256 TraceCheckUtils]: 4: Hoare triple {935#true} call #t~ret11 := main(); {935#true} is VALID [2018-11-23 10:25:20,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {935#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {935#true} is VALID [2018-11-23 10:25:20,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {935#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {958#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:20,500 INFO L256 TraceCheckUtils]: 7: Hoare triple {958#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {958#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:20,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {958#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {965#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {965#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {965#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {965#(and (= sum_~i~0 (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {972#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {972#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {972#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {972#(and (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {979#(and (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {979#(and (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,516 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {958#(bvsgt ~N~0 (_ bv1 32))} #64#return; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,518 INFO L256 TraceCheckUtils]: 18: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,529 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #66#return; {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:20,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {983#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1029#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-23 10:25:20,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {1029#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {936#false} is VALID [2018-11-23 10:25:20,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {936#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {936#false} is VALID [2018-11-23 10:25:20,533 INFO L256 TraceCheckUtils]: 31: Hoare triple {936#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {936#false} is VALID [2018-11-23 10:25:20,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {936#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {936#false} is VALID [2018-11-23 10:25:20,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {936#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {936#false} is VALID [2018-11-23 10:25:20,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {936#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {936#false} is VALID [2018-11-23 10:25:20,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {936#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {936#false} is VALID [2018-11-23 10:25:20,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {936#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {936#false} is VALID [2018-11-23 10:25:20,535 INFO L273 TraceCheckUtils]: 37: Hoare triple {936#false} assume !~bvslt32(~i~0, ~N~0); {936#false} is VALID [2018-11-23 10:25:20,535 INFO L273 TraceCheckUtils]: 38: Hoare triple {936#false} #res := ~ret~0[32:0]; {936#false} is VALID [2018-11-23 10:25:20,535 INFO L273 TraceCheckUtils]: 39: Hoare triple {936#false} assume true; {936#false} is VALID [2018-11-23 10:25:20,536 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {936#false} {936#false} #68#return; {936#false} is VALID [2018-11-23 10:25:20,536 INFO L273 TraceCheckUtils]: 41: Hoare triple {936#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {936#false} is VALID [2018-11-23 10:25:20,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {936#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {936#false} is VALID [2018-11-23 10:25:20,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {936#false} assume !false; {936#false} is VALID [2018-11-23 10:25:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:25:20,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:20,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {936#false} assume !false; {936#false} is VALID [2018-11-23 10:25:20,906 INFO L273 TraceCheckUtils]: 42: Hoare triple {936#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {936#false} is VALID [2018-11-23 10:25:20,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {936#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {936#false} is VALID [2018-11-23 10:25:20,907 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {935#true} {936#false} #68#return; {936#false} is VALID [2018-11-23 10:25:20,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {935#true} assume true; {935#true} is VALID [2018-11-23 10:25:20,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {935#true} #res := ~ret~0[32:0]; {935#true} is VALID [2018-11-23 10:25:20,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {935#true} assume !~bvslt32(~i~0, ~N~0); {935#true} is VALID [2018-11-23 10:25:20,908 INFO L273 TraceCheckUtils]: 36: Hoare triple {935#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {935#true} is VALID [2018-11-23 10:25:20,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {935#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {935#true} is VALID [2018-11-23 10:25:20,909 INFO L273 TraceCheckUtils]: 34: Hoare triple {935#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {935#true} is VALID [2018-11-23 10:25:20,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {935#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {935#true} is VALID [2018-11-23 10:25:20,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {935#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {935#true} is VALID [2018-11-23 10:25:20,910 INFO L256 TraceCheckUtils]: 31: Hoare triple {936#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {935#true} is VALID [2018-11-23 10:25:20,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {936#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {936#false} is VALID [2018-11-23 10:25:20,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {1117#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {936#false} is VALID [2018-11-23 10:25:20,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1117#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:20,914 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {935#true} {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #66#return; {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:20,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {935#true} assume true; {935#true} is VALID [2018-11-23 10:25:20,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {935#true} #res := ~ret~0[32:0]; {935#true} is VALID [2018-11-23 10:25:20,915 INFO L273 TraceCheckUtils]: 24: Hoare triple {935#true} assume !~bvslt32(~i~0, ~N~0); {935#true} is VALID [2018-11-23 10:25:20,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {935#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {935#true} is VALID [2018-11-23 10:25:20,916 INFO L273 TraceCheckUtils]: 22: Hoare triple {935#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {935#true} is VALID [2018-11-23 10:25:20,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {935#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {935#true} is VALID [2018-11-23 10:25:20,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {935#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {935#true} is VALID [2018-11-23 10:25:20,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {935#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {935#true} is VALID [2018-11-23 10:25:20,917 INFO L256 TraceCheckUtils]: 18: Hoare triple {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {935#true} is VALID [2018-11-23 10:25:20,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:20,942 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {935#true} {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #64#return; {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:20,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {935#true} assume true; {935#true} is VALID [2018-11-23 10:25:20,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#true} #res := ~ret~0[32:0]; {935#true} is VALID [2018-11-23 10:25:20,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {935#true} assume !~bvslt32(~i~0, ~N~0); {935#true} is VALID [2018-11-23 10:25:20,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {935#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {935#true} is VALID [2018-11-23 10:25:20,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {935#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {935#true} is VALID [2018-11-23 10:25:20,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {935#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {935#true} is VALID [2018-11-23 10:25:20,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {935#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {935#true} is VALID [2018-11-23 10:25:20,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {935#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {935#true} is VALID [2018-11-23 10:25:20,945 INFO L256 TraceCheckUtils]: 7: Hoare triple {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {935#true} is VALID [2018-11-23 10:25:20,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {935#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1121#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:20,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {935#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {935#true} is VALID [2018-11-23 10:25:20,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {935#true} call #t~ret11 := main(); {935#true} is VALID [2018-11-23 10:25:20,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {935#true} {935#true} #60#return; {935#true} is VALID [2018-11-23 10:25:20,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {935#true} assume true; {935#true} is VALID [2018-11-23 10:25:20,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {935#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {935#true} is VALID [2018-11-23 10:25:20,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {935#true} call ULTIMATE.init(); {935#true} is VALID [2018-11-23 10:25:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 10:25:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 10:25:20,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 10:25:20,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-23 10:25:20,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:20,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 10:25:21,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:21,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 10:25:21,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 10:25:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:25:21,143 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-11-23 10:25:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:22,599 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-11-23 10:25:22,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:25:22,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-23 10:25:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:25:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-23 10:25:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:25:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-23 10:25:22,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 83 transitions. [2018-11-23 10:25:22,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:22,780 INFO L225 Difference]: With dead ends: 72 [2018-11-23 10:25:22,780 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:25:22,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:25:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:25:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-23 10:25:22,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:22,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 48 states. [2018-11-23 10:25:22,878 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 48 states. [2018-11-23 10:25:22,878 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 48 states. [2018-11-23 10:25:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:22,884 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 10:25:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 10:25:22,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:22,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:22,885 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 54 states. [2018-11-23 10:25:22,886 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 54 states. [2018-11-23 10:25:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:22,890 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 10:25:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 10:25:22,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:22,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:22,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:22,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:25:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 10:25:22,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 44 [2018-11-23 10:25:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:22,896 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 10:25:22,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 10:25:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 10:25:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 10:25:22,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:22,898 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:22,898 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:22,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2051797468, now seen corresponding path program 1 times [2018-11-23 10:25:22,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:22,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:22,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:25:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:23,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:24,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 47 treesize of output 36 [2018-11-23 10:25:24,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:25:24,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 10:25:24,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:25:24,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 10:25:24,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:24,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:24,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:24,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:24,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:57, output treesize:31 [2018-11-23 10:25:25,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 65 treesize of output 50 [2018-11-23 10:25:25,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:25:25,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 10:25:25,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:25,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:25,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:25,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2018-11-23 10:25:25,930 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:25,931 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|]. (let ((.cse1 (select |v_#memory_int_17| |main_~#x~0.base|))) (let ((.cse2 (select .cse1 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (.cse3 (select .cse1 |main_~#x~0.offset|))) (let ((.cse0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) .cse2) ((_ sign_extend 32) .cse3) ((_ sign_extend 32) (_ bv0 32)))))) (and (= .cse0 main_~ret~1) (= (store |v_#memory_int_17| |main_~#x~0.base| (store .cse1 |main_~#x~0.offset| .cse2)) |#memory_int|) (= .cse0 main_~ret2~0) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= .cse3 main_~temp~0) (bvsgt ~N~0 (_ bv1 32)))))) [2018-11-23 10:25:25,931 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse1 (bvadd |main_~#x~0.offset| (_ bv4 32))))) (let ((.cse2 ((_ extract 31 0) (bvadd ((_ sign_extend 32) .cse0) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))))) (and (= |main_~#x~0.offset| (_ bv0 32)) (= .cse0 (select .cse1 |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= .cse2 main_~ret~1) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret2~0 .cse2))))) [2018-11-23 10:25:26,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 62 treesize of output 51 [2018-11-23 10:25:26,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:25:26,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:25:26,229 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:26,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-11-23 10:25:26,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:26,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:26,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:26,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:57 [2018-11-23 10:25:26,373 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:26,374 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, ~N~0, main_~temp~0]. (let ((.cse1 (select |v_#memory_int_18| |main_~#x~0.base|))) (let ((.cse2 (select .cse1 (bvadd |main_~#x~0.offset| (_ bv4 32))))) (let ((.cse0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) .cse2) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))))) (and (= main_~ret~1 .cse0) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= (store |v_#memory_int_18| |main_~#x~0.base| (store .cse1 (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) main_~temp~0)) |#memory_int|) (= .cse2 (select .cse1 |main_~#x~0.offset|)) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret2~0 .cse0))))) [2018-11-23 10:25:26,374 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [~N~0]. (let ((.cse0 ((_ extract 31 0) (let ((.cse1 (select |#memory_int| |main_~#x~0.base|))) (bvadd ((_ sign_extend 32) (select .cse1 |main_~#x~0.offset|)) ((_ sign_extend 32) (select .cse1 (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))))) (and (= main_~ret~1 .cse0) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 .cse0) (bvsgt ~N~0 (_ bv1 32)))) [2018-11-23 10:25:26,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 63 treesize of output 51 [2018-11-23 10:25:26,992 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:27,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-11-23 10:25:27,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:27,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:27,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:27,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:31 [2018-11-23 10:25:27,177 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:27,177 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#x~0.base|, ~N~0]. (let ((.cse3 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse1 ((_ sign_extend 32) (select .cse3 (_ bv0 32)))) (.cse2 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse0 ((_ extract 31 0) (bvadd .cse1 .cse2 ((_ sign_extend 32) (select .cse3 (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))))))) (and (= .cse0 main_~ret~1) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd .cse1 .cse2 ((_ sign_extend 32) (select .cse3 (_ bv4 32))))) |main_#t~ret10|) (= .cse0 main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))))) [2018-11-23 10:25:27,178 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_9, v_arrayElimCell_8]. (let ((.cse0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))))) (and (= .cse0 main_~ret2~0) (= .cse0 main_~ret~1) (= .cse0 |main_#t~ret10|))) [2018-11-23 10:25:27,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {1496#true} call ULTIMATE.init(); {1496#true} is VALID [2018-11-23 10:25:27,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {1496#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1496#true} is VALID [2018-11-23 10:25:27,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {1496#true} assume true; {1496#true} is VALID [2018-11-23 10:25:27,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1496#true} {1496#true} #60#return; {1496#true} is VALID [2018-11-23 10:25:27,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {1496#true} call #t~ret11 := main(); {1496#true} is VALID [2018-11-23 10:25:27,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {1496#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1496#true} is VALID [2018-11-23 10:25:27,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {1496#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1519#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,408 INFO L256 TraceCheckUtils]: 7: Hoare triple {1519#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {1523#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:27,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {1523#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1527#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-23 10:25:27,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {1527#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1531#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {1531#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1535#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-23 10:25:27,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {1535#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1539#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset|))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {1539#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset|))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1543#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset| (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {1543#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd (bvmul (_ bv4 32) sum_~i~0) |sum_#in~x.offset| (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0) (= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-23 10:25:27,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} #res := ~ret~0[32:0]; {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-23 10:25:27,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} assume true; {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-23 10:25:27,510 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} {1519#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #64#return; {1558#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret3|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {1558#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret3|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1562#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,556 INFO L256 TraceCheckUtils]: 18: Hoare triple {1562#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {1566#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {1566#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1570#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-23 10:25:27,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {1570#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1574#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {1574#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1578#(and (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-23 10:25:27,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {1578#(and (= sum_~x.offset |sum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-23 10:25:27,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-23 10:25:27,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} assume !~bvslt32(~i~0, ~N~0); {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} is VALID [2018-11-23 10:25:27,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {1547#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0))} #res := ~ret~0[32:0]; {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-23 10:25:27,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} assume true; {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} is VALID [2018-11-23 10:25:27,649 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1551#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))))))} {1562#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} #66#return; {1597#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret6|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {1597#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret6|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1601#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} is VALID [2018-11-23 10:25:27,702 INFO L273 TraceCheckUtils]: 29: Hoare triple {1601#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem9, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem9; {1605#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,704 INFO L273 TraceCheckUtils]: 30: Hoare triple {1605#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} #t~post8 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1605#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,705 INFO L273 TraceCheckUtils]: 31: Hoare triple {1605#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1605#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:27,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {1605#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)))) (bvsgt ~N~0 (_ bv1 32)))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1615#(and (exists ((~N~0 (_ BitVec 32))) (and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))) (= |main_~#x~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:25:27,751 INFO L256 TraceCheckUtils]: 33: Hoare triple {1615#(and (exists ((~N~0 (_ BitVec 32))) (and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))) (= |main_~#x~0.offset| (_ bv0 32)))} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {1496#true} is VALID [2018-11-23 10:25:27,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {1496#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1622#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} is VALID [2018-11-23 10:25:27,753 INFO L273 TraceCheckUtils]: 35: Hoare triple {1622#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= ((_ sign_extend 32) (_ bv0 32)) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1626#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base))} is VALID [2018-11-23 10:25:27,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {1626#(and (= sum_~i~0 (_ bv0 32)) (= sum_~x.offset |sum_#in~x.offset|) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) (bvadd (bvmul (_ bv4 32) sum_~i~0) sum_~x.offset))) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0) (= |sum_#in~x.base| sum_~x.base))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1630#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} is VALID [2018-11-23 10:25:27,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {1630#(and (= sum_~x.offset |sum_#in~x.offset|) (= |sum_#in~x.base| sum_~x.base) (= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| sum_~x.base) sum_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) sum_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1634#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} is VALID [2018-11-23 10:25:27,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {1634#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1634#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} is VALID [2018-11-23 10:25:27,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {1634#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} assume !~bvslt32(~i~0, ~N~0); {1634#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} is VALID [2018-11-23 10:25:27,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {1634#(= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|))) sum_~ret~0)} #res := ~ret~0[32:0]; {1644#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} is VALID [2018-11-23 10:25:27,774 INFO L273 TraceCheckUtils]: 41: Hoare triple {1644#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} assume true; {1644#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} is VALID [2018-11-23 10:25:27,823 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1644#(= |sum_#res| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) (bvadd |sum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |sum_#in~x.base|) |sum_#in~x.offset|)))))} {1615#(and (exists ((~N~0 (_ BitVec 32))) (and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))) (= |main_~#x~0.offset| (_ bv0 32)))} #68#return; {1651#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret10|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1)))} is VALID [2018-11-23 10:25:27,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {1651#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) |main_#t~ret10|) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1)))} ~ret5~0 := #t~ret10;havoc #t~ret10; {1655#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret5~0)))} is VALID [2018-11-23 10:25:27,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {1655#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret~1) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32)))) main_~ret5~0)))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1497#false} is VALID [2018-11-23 10:25:27,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2018-11-23 10:25:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:25:27,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:41,266 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 10:25:43,986 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-23 10:25:45,702 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 10:25:46,698 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 10:25:47,603 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 10:25:50,119 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 10:25:50,710 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:25:50,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:50,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 147 treesize of output 115 [2018-11-23 10:25:51,034 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:51,071 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:51,072 INFO L303 Elim1Store]: Index analysis took 185 ms [2018-11-23 10:25:51,073 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 96 [2018-11-23 10:25:51,796 WARN L180 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-23 10:25:51,855 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:51,877 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:51,880 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 74 [2018-11-23 10:25:51,973 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 62 [2018-11-23 10:25:52,490 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:52,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-11-23 10:25:52,494 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:52,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:52,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:52,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:52,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:52,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:52,542 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:209, output treesize:14 [2018-11-23 10:25:52,551 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:52,552 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_prenex_1, v_prenex_2, |#memory_int|, v_sum_~x.base_32]. (let ((.cse0 (bvslt (_ bv2 32) ~N~0)) (.cse5 ((_ sign_extend 32) (_ bv0 32))) (.cse3 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (and (or .cse0 (let ((.cse1 (select v_prenex_1 v_prenex_2))) (let ((.cse4 (select .cse1 |main_~#x~0.offset|))) (let ((.cse2 (select .cse1 .cse3)) (.cse6 ((_ sign_extend 32) .cse4))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (store (store .cse1 |main_~#x~0.offset| .cse2) .cse3 .cse4) |main_~#x~0.offset|)) .cse5 .cse6)) ((_ extract 31 0) (bvadd ((_ sign_extend 32) .cse2) .cse5 .cse6))))))) (or .cse0 (let ((.cse11 (select |#memory_int| v_sum_~x.base_32))) (let ((.cse7 (select .cse11 .cse3)) (.cse8 (select .cse11 |main_~#x~0.offset|))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) .cse7) .cse5 ((_ sign_extend 32) .cse8))) ((_ extract 31 0) (let ((.cse9 (let ((.cse10 (store (store .cse11 |main_~#x~0.offset| .cse7) .cse3 .cse8))) (store (store .cse10 |main_~#x~0.offset| .cse8) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) (select .cse10 |main_~#x~0.offset|))))) (bvadd ((_ sign_extend 32) (select .cse9 .cse3)) ((_ sign_extend 32) (select .cse9 |main_~#x~0.offset|)) .cse5))))))))) [2018-11-23 10:25:52,552 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (bvmul (_ bv4 32) ~N~0))) (or (bvslt (_ bv2 32) ~N~0) (= (_ bv4 32) .cse0) (= (_ bv8 32) .cse0))) [2018-11-23 10:25:55,163 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 10:25:56,304 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 10:25:57,283 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 10:25:58,283 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 10:25:59,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 65 [2018-11-23 10:25:59,684 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:59,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-11-23 10:25:59,798 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:59,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-11-23 10:25:59,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:59,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:59,971 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:59,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 10:25:59,981 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:00,140 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:00,144 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:00,199 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-23 10:26:00,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 57 treesize of output 125 [2018-11-23 10:26:02,416 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 170 DAG size of output: 155 [2018-11-23 10:26:02,439 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:02,440 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:02,441 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:02,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 10:26:02,456 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:03,205 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:03,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:03,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:26:03,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 62 [2018-11-23 10:26:03,221 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:05,870 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:05,871 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:05,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 105 [2018-11-23 10:26:06,015 INFO L267 ElimStorePlain]: Start of recursive call 9: 14 dim-0 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-11-23 10:26:08,268 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:08,269 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:08,270 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:08,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 95 [2018-11-23 10:26:08,337 INFO L267 ElimStorePlain]: Start of recursive call 10: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-23 10:26:09,494 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:09,495 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:09,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 101 [2018-11-23 10:26:09,842 INFO L267 ElimStorePlain]: Start of recursive call 11: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 16 xjuncts. [2018-11-23 10:26:11,484 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:11,497 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:11,506 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:11,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-11-23 10:26:11,536 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:13,115 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:13,117 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:13,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 93 [2018-11-23 10:26:13,231 INFO L267 ElimStorePlain]: Start of recursive call 13: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-11-23 10:26:14,729 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, 8 dim-1 vars, End of recursive call: 33 dim-0 vars, and 14 xjuncts. [2018-11-23 10:26:16,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 37 dim-0 vars, and 15 xjuncts. [2018-11-23 10:26:16,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2018-11-23 10:26:16,484 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:16,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-11-23 10:26:16,579 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:16,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-11-23 10:26:16,585 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:16,631 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:16,788 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:16,792 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:17,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 127 [2018-11-23 10:26:19,030 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 172 DAG size of output: 157 [2018-11-23 10:26:19,057 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:19,057 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:19,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:26:19,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 64 [2018-11-23 10:26:19,065 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:25,690 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:25,691 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:25,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 95 [2018-11-23 10:26:25,930 INFO L267 ElimStorePlain]: Start of recursive call 19: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-11-23 10:26:26,542 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:26,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:26,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:26,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 97 [2018-11-23 10:26:26,602 INFO L267 ElimStorePlain]: Start of recursive call 20: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-23 10:26:27,265 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:27,266 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:27,266 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:27,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-11-23 10:26:27,283 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:27,824 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:27,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:27,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 103 [2018-11-23 10:26:28,007 INFO L267 ElimStorePlain]: Start of recursive call 22: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 16 xjuncts. [2018-11-23 10:26:29,601 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:29,602 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:29,602 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:29,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-23 10:26:29,615 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:30,753 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:30,753 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:30,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 103 [2018-11-23 10:26:30,917 INFO L267 ElimStorePlain]: Start of recursive call 24: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 16 xjuncts. [2018-11-23 10:26:33,725 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-0 vars, 8 dim-1 vars, End of recursive call: 33 dim-0 vars, and 14 xjuncts. [2018-11-23 10:26:35,504 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:35,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-11-23 10:26:35,513 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:37,288 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 37 dim-0 vars, and 15 xjuncts. [2018-11-23 10:26:37,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2018-11-23 10:26:37,350 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:37,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-11-23 10:26:37,361 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:37,494 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:37,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-11-23 10:26:37,621 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:37,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-11-23 10:26:37,627 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:37,663 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:37,808 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:37,815 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:38,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 127 [2018-11-23 10:26:39,886 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 171 DAG size of output: 156 [2018-11-23 10:26:39,952 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:39,953 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:40,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 107 [2018-11-23 10:26:40,064 INFO L267 ElimStorePlain]: Start of recursive call 31: 14 dim-0 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-11-23 10:26:53,665 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:53,665 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:53,667 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:53,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 97 [2018-11-23 10:26:53,785 INFO L267 ElimStorePlain]: Start of recursive call 32: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-23 10:26:56,125 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:56,126 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:56,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 103 [2018-11-23 10:26:56,653 INFO L267 ElimStorePlain]: Start of recursive call 33: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 16 xjuncts. [2018-11-23 10:26:58,521 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:58,521 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:58,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 95 [2018-11-23 10:26:58,635 INFO L267 ElimStorePlain]: Start of recursive call 34: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-11-23 10:27:01,806 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:01,807 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:01,807 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:01,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-11-23 10:27:01,821 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:03,427 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:03,429 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:03,429 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:03,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-23 10:27:03,444 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:04,904 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-0 vars, 8 dim-1 vars, End of recursive call: 33 dim-0 vars, and 14 xjuncts. [2018-11-23 10:27:06,684 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: 37 dim-0 vars, and 15 xjuncts. [2018-11-23 10:27:24,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 141 [2018-11-23 10:27:24,196 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:24,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 111 [2018-11-23 10:27:24,341 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:24,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2018-11-23 10:27:24,380 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:24,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-11-23 10:27:25,094 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-23 10:27:25,112 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:25,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 64 [2018-11-23 10:27:25,116 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:25,133 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:25,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 71 [2018-11-23 10:27:25,137 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:25,139 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:27:25,140 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:25,143 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:27:25,144 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:25,156 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:25,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-11-23 10:27:25,160 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:25,163 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:27:25,164 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:25,178 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:25,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 43 [2018-11-23 10:27:25,183 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:25,254 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:25,283 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:25,346 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:25,499 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:25,504 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:25,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 133 treesize of output 172 [2018-11-23 10:27:28,574 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 226 DAG size of output: 205 [2018-11-23 10:27:28,597 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:28,602 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:28,603 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:28,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 167 [2018-11-23 10:27:28,817 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:28,817 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:28,818 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:28,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 138 [2018-11-23 10:27:29,468 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2018-11-23 10:27:29,486 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:29,486 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:29,489 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:29,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 73 [2018-11-23 10:27:29,547 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:27:29,699 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:27:30,213 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:30,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:30,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:30,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:30,259 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 137 [2018-11-23 10:27:31,082 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2018-11-23 10:27:31,136 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:31,137 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:31,137 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:31,137 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:31,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2018-11-23 10:27:31,166 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:31,253 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:31,612 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:31,613 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:31,613 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:31,641 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 109 [2018-11-23 10:27:33,580 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2018-11-23 10:27:33,634 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:33,635 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:33,635 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:33,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-23 10:27:33,656 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:33,734 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:33,982 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-23 10:27:35,810 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:35,810 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:35,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:27:35,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 121 [2018-11-23 10:27:35,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2018-11-23 10:27:38,106 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-23 10:27:38,118 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:27:38,119 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:38,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-11-23 10:27:38,141 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:38,148 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:27:38,149 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:38,198 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:38,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:27:38,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 61 [2018-11-23 10:27:38,205 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:38,310 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:38,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:27:38,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2018-11-23 10:27:38,318 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:38,321 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:27:38,322 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:38,348 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:38,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:27:38,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-11-23 10:27:38,354 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:38,398 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:38,430 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:48,727 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:48,731 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:49,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 143 [2018-11-23 10:27:49,131 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:49,131 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:49,136 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:49,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 148 [2018-11-23 10:27:50,327 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2018-11-23 10:27:50,423 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:50,424 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:50,424 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:50,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 102 [2018-11-23 10:27:50,468 INFO L267 ElimStorePlain]: Start of recursive call 67: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:27:51,284 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:51,284 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:51,285 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:51,285 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:51,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 104 [2018-11-23 10:27:51,304 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:51,495 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 10:27:51,907 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:51,912 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:51,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 135 [2018-11-23 10:27:52,157 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-11-23 10:27:52,192 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:52,193 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:52,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 65 [2018-11-23 10:27:52,234 INFO L267 ElimStorePlain]: Start of recursive call 70: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:27:52,318 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:27:52,542 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-23 10:27:55,959 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:55,962 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:56,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 152 [2018-11-23 10:27:56,139 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:56,144 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:56,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 110 [2018-11-23 10:27:58,339 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2018-11-23 10:27:58,366 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:58,366 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:58,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 46 [2018-11-23 10:27:58,382 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:58,401 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:27:59,032 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:59,033 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:59,037 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:27:59,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 145 [2018-11-23 10:28:07,937 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 229 DAG size of output: 133 [2018-11-23 10:28:07,953 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:07,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-11-23 10:28:07,957 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:08,482 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:08,482 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:08,483 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:08,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2018-11-23 10:28:08,498 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:08,783 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:08,783 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:08,784 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:08,784 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:08,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 104 [2018-11-23 10:28:08,803 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:09,025 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:09,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:09,027 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:09,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 82 [2018-11-23 10:28:09,093 INFO L267 ElimStorePlain]: Start of recursive call 78: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:28:09,605 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-0 vars, 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:09,910 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:09,913 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:09,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 106 [2018-11-23 10:28:12,118 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2018-11-23 10:28:12,144 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:12,144 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:12,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 68 [2018-11-23 10:28:12,258 INFO L267 ElimStorePlain]: Start of recursive call 80: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-23 10:28:12,340 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:28:12,930 INFO L267 ElimStorePlain]: Start of recursive call 71: 6 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-23 10:28:14,833 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:14,839 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:14,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 130 [2018-11-23 10:28:14,962 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:14,966 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:14,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 110 [2018-11-23 10:28:15,258 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-11-23 10:28:15,287 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:15,288 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:15,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-11-23 10:28:15,304 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:15,326 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:15,537 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:15,538 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:15,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:15,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 140 [2018-11-23 10:28:17,858 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 105 [2018-11-23 10:28:17,919 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:17,920 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:17,920 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:17,926 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:17,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 91 [2018-11-23 10:28:17,933 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:18,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-11-23 10:28:18,771 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:19,058 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:19,058 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:19,059 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:19,059 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:19,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 108 [2018-11-23 10:28:19,067 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:19,174 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:28:19,256 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 10:28:20,994 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:20,995 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:20,995 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:21,016 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 126 [2018-11-23 10:28:21,142 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:21,143 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:21,162 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 104 [2018-11-23 10:28:22,065 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-11-23 10:28:22,126 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,127 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-11-23 10:28:22,144 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:22,208 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,209 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 55 [2018-11-23 10:28:22,238 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:22,291 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:28:22,291 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:22,333 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:28:22,334 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:22,396 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,396 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 63 [2018-11-23 10:28:22,413 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:22,469 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,469 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:22,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-11-23 10:28:22,513 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:22,517 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:28:22,518 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:22,714 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-23 10:28:22,884 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-23 10:28:24,885 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:24,886 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:24,886 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:24,902 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 144 [2018-11-23 10:28:24,972 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:24,972 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:24,984 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 116 [2018-11-23 10:28:25,910 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-11-23 10:28:25,925 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:28:25,925 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:25,978 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:28:25,979 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:26,021 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:28:26,022 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:26,069 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:26,071 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:26,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 78 [2018-11-23 10:28:26,081 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:26,142 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:26,143 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:26,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 87 [2018-11-23 10:28:26,151 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:26,200 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:28:26,201 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:26,292 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:26,308 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:26,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-23 10:28:26,315 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:26,460 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:26,628 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:28,712 INFO L267 ElimStorePlain]: Start of recursive call 48: 3 dim-0 vars, 8 dim-1 vars, End of recursive call: 43 dim-0 vars, and 17 xjuncts. [2018-11-23 10:28:31,463 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:31,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-11-23 10:28:31,475 INFO L267 ElimStorePlain]: Start of recursive call 106: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:34,144 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-1 vars, End of recursive call: 47 dim-0 vars, and 18 xjuncts. [2018-11-23 10:28:34,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 139 [2018-11-23 10:28:34,231 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:34,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 109 [2018-11-23 10:28:34,373 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 10:28:34,394 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:34,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2018-11-23 10:28:34,425 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:34,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-11-23 10:28:35,434 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-23 10:28:35,455 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:35,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 43 [2018-11-23 10:28:35,459 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:35,467 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:35,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-11-23 10:28:35,489 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:35,502 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:35,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 71 [2018-11-23 10:28:35,506 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:35,530 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:35,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2018-11-23 10:28:35,537 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:35,552 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:35,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 64 [2018-11-23 10:28:35,557 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:35,579 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:35,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 71 [2018-11-23 10:28:35,584 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:35,614 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:35,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-11-23 10:28:35,618 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:35,746 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:35,859 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:35,985 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:36,267 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:36,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-23 10:28:36,279 INFO L267 ElimStorePlain]: Start of recursive call 118: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:36,288 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:36,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-23 10:28:36,300 INFO L267 ElimStorePlain]: Start of recursive call 119: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:36,307 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:36,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-23 10:28:36,334 INFO L267 ElimStorePlain]: Start of recursive call 120: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:36,930 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:36,996 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:37,057 INFO L303 Elim1Store]: Index analysis took 235 ms [2018-11-23 10:28:37,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 131 treesize of output 170 [2018-11-23 10:28:40,543 WARN L180 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 225 DAG size of output: 204 [2018-11-23 10:28:40,707 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:40,720 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:40,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:40,795 INFO L303 Elim1Store]: Index analysis took 192 ms [2018-11-23 10:28:40,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 119 [2018-11-23 10:28:40,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2018-11-23 10:28:43,123 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-23 10:28:43,150 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:43,150 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:43,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:43,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-11-23 10:28:43,156 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:43,172 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:43,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:43,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-11-23 10:28:43,178 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:43,216 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:43,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:43,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 68 [2018-11-23 10:28:43,228 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:43,254 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:43,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:43,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 61 [2018-11-23 10:28:43,260 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:43,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2018-11-23 10:28:43,276 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:43,352 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:43,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:43,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2018-11-23 10:28:43,359 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:43,373 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:43,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:43,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-11-23 10:28:43,380 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:43,495 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:43,595 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 10:28:45,568 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:45,569 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:45,570 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:45,590 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 142 [2018-11-23 10:28:45,654 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:45,654 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:45,670 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 116 [2018-11-23 10:28:46,715 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-11-23 10:28:46,776 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:46,777 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:46,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 78 [2018-11-23 10:28:46,785 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:46,853 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:46,853 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:46,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-11-23 10:28:46,860 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:46,941 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:46,941 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:46,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 87 [2018-11-23 10:28:46,950 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:47,017 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,017 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2018-11-23 10:28:47,034 INFO L267 ElimStorePlain]: Start of recursive call 136: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:47,068 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,083 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,092 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2018-11-23 10:28:47,104 INFO L267 ElimStorePlain]: Start of recursive call 137: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:47,164 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,164 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 78 [2018-11-23 10:28:47,176 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:47,239 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,240 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:47,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-11-23 10:28:47,245 INFO L267 ElimStorePlain]: Start of recursive call 139: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:28:47,630 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-23 10:28:48,049 INFO L267 ElimStorePlain]: Start of recursive call 131: 1 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-23 10:28:51,246 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:51,249 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:51,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:28:51,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 119 [2018-11-23 10:28:51,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80